Rasmus Ibsen-Jensen
Chatterjee Group
44 Publications
2022 | Published | Conference Paper | IST-REx-ID: 12101 |

Complexity of spatial games
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
2021 | Published | Conference Paper | IST-REx-ID: 10629 |

Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 | Published | Journal Article | IST-REx-ID: 9393 |

Faster algorithms for quantitative verification in bounded treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
2020 | Research Data Reference | IST-REx-ID: 9814 |

Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).
2020 | Published | Conference Paper | IST-REx-ID: 8533 |

Simplified game of life: Algorithms and complexity
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version]
View
| Files available
| DOI
| arXiv
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
2020 | Published | Journal Article | IST-REx-ID: 9197
All-pay bidding games on graphs
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
[Preprint]
View
| DOI
| arXiv
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
2020 | Published | Conference Paper | IST-REx-ID: 7810 |

Optimal and perfectly parallel algorithms for on-demand data-flow analysis
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
[Published Version]
View
| Files available
| DOI
| WoS
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
2019 | Published | Conference Paper | IST-REx-ID: 6822 |

Bidding games on Markov decision processes
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
[Submitted Version]
View
| Files available
| DOI
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
2019 | Published | Journal Article | IST-REx-ID: 7158 |

Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).
[Submitted Version]
View
| Files available
| DOI
| WoS
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).
2018 | Conference Paper | IST-REx-ID: 5788 |

Infinite-duration poorman-bidding games
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
2018 | Published | Conference Paper | IST-REx-ID: 5967 |

The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
[Submitted Version]
View
| Files available
| DOI
| WoS
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
2018 | Published | Journal Article | IST-REx-ID: 198 |

Language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
2018 | Published | Conference Paper | IST-REx-ID: 66 |

Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version]
View
| Files available
| DOI
| arXiv
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
2018 | Published | Journal Article | IST-REx-ID: 6009 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
2017 | Published | Journal Article | IST-REx-ID: 465 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
2017 | Published | Conference Paper | IST-REx-ID: 551 |

Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 553 |

Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2016 | Published | Conference Paper | IST-REx-ID: 1071 |

Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
2016 | Published | Conference Paper | IST-REx-ID: 1340 |

The big match in small space
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.
2016 | Published | Conference Paper | IST-REx-ID: 1182 |

Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
[Preprint]
View
| Files available
| Download Preprint (ext.)
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
2016 | Published | Conference Paper | IST-REx-ID: 478 |

The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
2016 | Published | Conference Paper | IST-REx-ID: 1437 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
2015 | Published | Technical Report | IST-REx-ID: 5441 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
2015 | Published | Conference Paper | IST-REx-ID: 10796
The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
[Preprint]
View
| DOI
| arXiv
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
2015 | Published | Journal Article | IST-REx-ID: 524 |

Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
2015 | Published | Technical Report | IST-REx-ID: 5430 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5431 |

The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5432 |

The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5437 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5438 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5440 |

The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
2015 | Published | Journal Article | IST-REx-ID: 1559 |

Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
2015 | Published | Journal Article | IST-REx-ID: 1602 |

Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.
2015 | Published | Conference Paper | IST-REx-ID: 1607 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
2015 | Published | Conference Paper | IST-REx-ID: 1610 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.
2014 | Published | Technical Report | IST-REx-ID: 5419 |

Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5420 |

The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5421 |

The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5427 |

Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
2014 | Published | Conference Paper | IST-REx-ID: 2162 |

The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
2014 | Published | Conference Paper | IST-REx-ID: 2216 |

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
2013 | Published | Technical Report | IST-REx-ID: 5403 |

Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 5404 |

The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 5409 |

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
Search
Filter Publications
Display / Sort
Export / Embed
Grants
44 Publications
2022 | Published | Conference Paper | IST-REx-ID: 12101 |

Complexity of spatial games
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
2021 | Published | Conference Paper | IST-REx-ID: 10629 |

Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 | Published | Journal Article | IST-REx-ID: 9393 |

Faster algorithms for quantitative verification in bounded treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
2020 | Research Data Reference | IST-REx-ID: 9814 |

Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, (2020).
2020 | Published | Conference Paper | IST-REx-ID: 8533 |

Simplified game of life: Algorithms and complexity
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version]
View
| Files available
| DOI
| arXiv
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 45th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
2020 | Published | Journal Article | IST-REx-ID: 9197
All-pay bidding games on graphs
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
[Preprint]
View
| DOI
| arXiv
G. Avni, R. Ibsen-Jensen, J. Tkadlec, Proceedings of the AAAI Conference on Artificial Intelligence 34 (2020) 1798–1805.
2020 | Published | Conference Paper | IST-REx-ID: 7810 |

Optimal and perfectly parallel algorithms for on-demand data-flow analysis
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
[Published Version]
View
| Files available
| DOI
| WoS
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
2019 | Published | Conference Paper | IST-REx-ID: 6822 |

Bidding games on Markov decision processes
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
[Submitted Version]
View
| Files available
| DOI
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, P. Novotny, in:, Proceedings of the 13th International Conference of Reachability Problems, Springer, 2019, pp. 1–12.
2019 | Published | Journal Article | IST-REx-ID: 7158 |

Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).
[Submitted Version]
View
| Files available
| DOI
| WoS
K. Chatterjee, A.K. Goharshady, P. Goyal, R. Ibsen-Jensen, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 41 (2019).
2018 | Conference Paper | IST-REx-ID: 5788 |

Infinite-duration poorman-bidding games
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.
2018 | Published | Conference Paper | IST-REx-ID: 5967 |

The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
[Submitted Version]
View
| Files available
| DOI
| WoS
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
2018 | Published | Journal Article | IST-REx-ID: 198 |

Language acquisition with communication between learners
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, M. Nowak, Journal of the Royal Society Interface 15 (2018).
2018 | Published | Conference Paper | IST-REx-ID: 66 |

Ergodic mean-payoff games for the analysis of attacks in crypto-currencies
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version]
View
| Files available
| DOI
| arXiv
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, Y. Velner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
2018 | Published | Journal Article | IST-REx-ID: 6009 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, ACM Transactions on Programming Languages and Systems 40 (2018).
2017 | Published | Journal Article | IST-REx-ID: 465 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
2017 | Published | Conference Paper | IST-REx-ID: 551 |

Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2017 | Published | Conference Paper | IST-REx-ID: 553 |

Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
2016 | Published | Conference Paper | IST-REx-ID: 1071 |

Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.
2016 | Published | Conference Paper | IST-REx-ID: 1340 |

The big match in small space
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.
[Preprint]
View
| DOI
| Download Preprint (ext.)
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.
2016 | Published | Conference Paper | IST-REx-ID: 1182 |

Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
[Preprint]
View
| Files available
| Download Preprint (ext.)
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.
2016 | Published | Conference Paper | IST-REx-ID: 478 |

The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
2016 | Published | Conference Paper | IST-REx-ID: 1437 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, ACM, 2016, pp. 733–747.
2015 | Published | Technical Report | IST-REx-ID: 5441 |

Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
2015 | Published | Conference Paper | IST-REx-ID: 10796
The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
[Preprint]
View
| DOI
| arXiv
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
2015 | Published | Journal Article | IST-REx-ID: 524 |

Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
2015 | Published | Technical Report | IST-REx-ID: 5430 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5431 |

The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5432 |

The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5437 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5438 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for Pushdown Automata, IST Austria, 2015.
2015 | Published | Technical Report | IST-REx-ID: 5440 |

The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
2015 | Published | Journal Article | IST-REx-ID: 1559 |

Computational complexity of ecological and evolutionary spatial dynamics
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
R. Ibsen-Jensen, K. Chatterjee, M. Nowak, PNAS 112 (2015) 15636–15641.
2015 | Published | Journal Article | IST-REx-ID: 1602 |

Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, P. Goyal, ACM SIGPLAN Notices 50 (2015) 97–109.
2015 | Published | Conference Paper | IST-REx-ID: 1607 |

Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Springer, 2015, pp. 140–157.
2015 | Published | Conference Paper | IST-REx-ID: 1610 |

Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 121–133.
2014 | Published | Technical Report | IST-REx-ID: 5419 |

Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5420 |

The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5421 |

The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
2014 | Published | Technical Report | IST-REx-ID: 5427 |

Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
2014 | Published | Conference Paper | IST-REx-ID: 2162 |

The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
2014 | Published | Conference Paper | IST-REx-ID: 2216 |

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
2013 | Published | Technical Report | IST-REx-ID: 5403 |

Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 5404 |

The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 5409 |

Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.