 | Up a level |
Avni, G, Henzinger, TA, Ibsen-Jensen, R and Novotný, P
(2019)
Bidding Games on Markov Decision Processes.
.
Chatterjee, K, Goharshady, AK, Ibsen-Jensen, R and Velner, Y
(2018)
Ergodic mean-payo games for the analysis of attacks in crypto-currencies.
Leibniz International Proceedings in Informatics, LIPIcs, 118.
Chatterjee, K, Ibsen-Jensen, R and Nowak, MA
(2017)
Faster Monte-Carlo algorithms for fixation probability of the moran process on undirected graphs.
.
Avni, G, Henzinger, TA and Ibsen-Jensen, R
(2018)
Infinite-duration poorman-bidding games.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11316 .
21 - 36.
Chatterjee, K, Ibsen-Jensen, R and Pavlogiannis, A
(2016)
Optimal reachability and a space-time tradeoff for distance queries in constant-treewidth graphs.
.
Chatterjee, K, Ibsen-Jensen, R and Tkadlec, J
(2016)
Robust draws in balanced knockout tournaments.
.
Chatterjee, K, Hansen, KA and Ibsen-Jensen, R
(2017)
Strategy complexity of concurrent safety games.
.
Hansen, KA, Ibsen-Jensen, R and Neyman, A
(2018)
The big match with a clock and a bit of memory.
.
Chatterjee, K and Ibsen-Jensen, R
(2015)
The value 1 problem under finite-memory strategies for concurrent mean-payoff games.
.