Rasmus Ibsen-Jensen

Chatterjee Group

44 Publications

Mark all

[44]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
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
 
[43]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
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
 
[42]
2021 | Journal Article | IST-REx-ID: 9393 | OA
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
 
[41]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
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
 
[40]
2020 | 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
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
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.)
 
[38]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
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
 
[37]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
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
 
[36]
2019 | Journal Article | IST-REx-ID: 7158 | OA
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
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
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
 
[34]
2018 | Conference Paper | IST-REx-ID: 5967 | OA
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
 
[33]
2018 | Journal Article | IST-REx-ID: 198 | OA
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
 
[32]
2018 | Conference Paper | IST-REx-ID: 66 | OA
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
 
[31]
2018 | Journal Article | IST-REx-ID: 6009 | OA
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
 
[30]
2017 | Journal Article | IST-REx-ID: 465 | OA
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
 
[29]
2017 | Conference Paper | IST-REx-ID: 551 | OA
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
 
[28]
2017 | Conference Paper | IST-REx-ID: 553 | OA
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.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
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.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340 | OA
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.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478 | OA
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
 
[24]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
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
 
[23]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
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
 
[22]
2015 | 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
 
[21]
2015 | Journal Article | IST-REx-ID: 1559 | OA
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
 
[20]
2015 | Journal Article | IST-REx-ID: 524 | OA
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
 
[19]
2015 | Technical Report | IST-REx-ID: 5431 | OA
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
 
[18]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
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
 
[17]
2015 | Technical Report | IST-REx-ID: 5437 | OA
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
 
[16]
2015 | Technical Report | IST-REx-ID: 5430 | OA
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
 
[15]
2015 | Technical Report | IST-REx-ID: 5438 | OA
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
 
[14]
2015 | Technical Report | IST-REx-ID: 5440 | OA
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
 
[13]
2015 | Technical Report | IST-REx-ID: 5432 | OA
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
 
[12]
2015 | Journal Article | IST-REx-ID: 1602 | OA
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
 
[11]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
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.)
 
[10]
2015 | Technical Report | IST-REx-ID: 5441 | OA
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
 
[9]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
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
 
[8]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
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.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5419 | OA
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
 
[6]
2014 | Technical Report | IST-REx-ID: 5420 | OA
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
 
[5]
2014 | Technical Report | IST-REx-ID: 5427 | OA
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
 
[4]
2014 | Technical Report | IST-REx-ID: 5421 | OA
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
 
[3]
2013 | Technical Report | IST-REx-ID: 5403 | OA
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
 
[2]
2013 | Technical Report | IST-REx-ID: 5404 | OA
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5409 | OA
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
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed

44 Publications

Mark all

[44]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
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
 
[43]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
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
 
[42]
2021 | Journal Article | IST-REx-ID: 9393 | OA
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
 
[41]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
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
 
[40]
2020 | 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
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
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.)
 
[38]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
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
 
[37]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
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
 
[36]
2019 | Journal Article | IST-REx-ID: 7158 | OA
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
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
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
 
[34]
2018 | Conference Paper | IST-REx-ID: 5967 | OA
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
 
[33]
2018 | Journal Article | IST-REx-ID: 198 | OA
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
 
[32]
2018 | Conference Paper | IST-REx-ID: 66 | OA
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
 
[31]
2018 | Journal Article | IST-REx-ID: 6009 | OA
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
 
[30]
2017 | Journal Article | IST-REx-ID: 465 | OA
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
 
[29]
2017 | Conference Paper | IST-REx-ID: 551 | OA
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
 
[28]
2017 | Conference Paper | IST-REx-ID: 553 | OA
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.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
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.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340 | OA
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.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478 | OA
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
 
[24]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
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
 
[23]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
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
 
[22]
2015 | 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
 
[21]
2015 | Journal Article | IST-REx-ID: 1559 | OA
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
 
[20]
2015 | Journal Article | IST-REx-ID: 524 | OA
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
 
[19]
2015 | Technical Report | IST-REx-ID: 5431 | OA
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
 
[18]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
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
 
[17]
2015 | Technical Report | IST-REx-ID: 5437 | OA
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
 
[16]
2015 | Technical Report | IST-REx-ID: 5430 | OA
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
 
[15]
2015 | Technical Report | IST-REx-ID: 5438 | OA
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
 
[14]
2015 | Technical Report | IST-REx-ID: 5440 | OA
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
 
[13]
2015 | Technical Report | IST-REx-ID: 5432 | OA
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
 
[12]
2015 | Journal Article | IST-REx-ID: 1602 | OA
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
 
[11]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
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.)
 
[10]
2015 | Technical Report | IST-REx-ID: 5441 | OA
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
 
[9]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
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
 
[8]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
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.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5419 | OA
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
 
[6]
2014 | Technical Report | IST-REx-ID: 5420 | OA
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
 
[5]
2014 | Technical Report | IST-REx-ID: 5427 | OA
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
 
[4]
2014 | Technical Report | IST-REx-ID: 5421 | OA
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
 
[3]
2013 | Technical Report | IST-REx-ID: 5403 | OA
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
 
[2]
2013 | Technical Report | IST-REx-ID: 5404 | OA
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5409 | OA
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
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Default

    Export / Embed