 | Up a level |
Chatterjee, K, Ibsen-Jensen, R 
ORCID: 0000-0003-4783-0389, Jecker, I and Svoboda, J
(2022)
Complexity of Spatial Games.
.
Chatterjee, K, Goharshady, AK, Ibsen-Jensen, R ORCID: 0000-0003-4783-0389 and Velner, Y
(2018)
Ergodic mean-payo games for the analysis of attacks in crypto-currencies.
Leibniz International Proceedings in Informatics, LIPIcs, 118.
11:1-11:1.
Chatterjee, K, Ibsen-Jensen, R ORCID: 0000-0003-4783-0389 and Nowak, MA
(2017)
Faster Monte-Carlo algorithms for fixation probability of the moran process on undirected graphs.
.
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 ORCID: 0000-0003-4783-0389 and Pavlogiannis, A
(2021)
Quantitative Verification on Product Graphs of Small Treewidth.
In: FSTTCS 2021, 2021-12-15 - 2021-12-17, (Virtual conference).
Chatterjee, K, Ibsen-Jensen, R and Tkadlec, J
(2016)
Robust draws in balanced knockout tournaments.
.
Chatterjee, K, Ibsen-Jensen, R ORCID: 0000-0003-4783-0389, Jecker, I and Svoboda, J
(2020)
Simplified game of life: Algorithms and complexity.
.
Chatterjee, K, Hansen, KA and Ibsen-Jensen, R ORCID: 0000-0003-4783-0389
(2017)
Strategy complexity of concurrent safety games.
.