Rasmus Ibsen-Jensen

Chatterjee Group

44 Publications

Mark all

[44]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[43]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI
 
[42]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[40]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
[Published Version] View | Files available | DOI | arXiv
 
[39]
2020 | Published | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.
[Preprint] View | DOI | arXiv
 
[38]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Published | Conference Paper | IST-REx-ID: 5967 | OA
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
[Submitted Version] View | Files available | DOI | WoS
 
[33]
2018 | Published | Journal Article | IST-REx-ID: 198 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[32]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI
 
[29]
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[28]
2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[27]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | Files available | DOI
 
[26]
2016 | Published | Conference Paper | IST-REx-ID: 1340 | OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
[Preprint] View | DOI | Download Preprint (ext.)
 
[25]
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
[Preprint] View | Files available | Download Preprint (ext.)
 
[24]
2016 | Published | Conference Paper | IST-REx-ID: 478 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
[Published Version] View | Files available | DOI
 
[23]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Published | Conference Paper | IST-REx-ID: 10796
K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.
[Preprint] View | DOI | arXiv
 
[21]
2015 | Published | Journal Article | IST-REx-ID: 524 | OA
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[20]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[19]
2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[18]
2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[17]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[16]
2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[15]
2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[14]
2015 | Published | Journal Article | IST-REx-ID: 1559 | OA
R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51. National Academy of Sciences, pp. 15636–15641, 2015.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[13]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[11]
2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View | Files available | DOI | Download None (ext.) | arXiv
 
[10]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and 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 | Published | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[8]
2014 | Published | Technical Report | IST-REx-ID: 5420 | OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[7]
2014 | Published | Technical Report | IST-REx-ID: 5421 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 2162 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[4]
2014 | Published | Conference Paper | IST-REx-ID: 2216 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2013 | Published | Technical Report | IST-REx-ID: 5403 | OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | Technical Report | IST-REx-ID: 5404 | OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5409 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

Grants


44 Publications

Mark all

[44]
2022 | Published | Conference Paper | IST-REx-ID: 12101 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
[Published Version] View | Files available | DOI
 
[43]
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
[Published Version] View | Files available | DOI
 
[42]
2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in bounded treewidth graphs,” Formal Methods in System Design, vol. 57. Springer, pp. 401–428, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Data and mathematica notebooks for plotting figures from language learning with communication between learners from language acquisition with communication between learners.” Royal Society, 2020.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[40]
2020 | Published | Conference Paper | IST-REx-ID: 8533 | OA
K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Simplified game of life: Algorithms and complexity,” in 45th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, 2020, vol. 170.
[Published Version] View | Files available | DOI | arXiv
 
[39]
2020 | Published | Journal Article | IST-REx-ID: 9197
G. Avni, R. Ibsen-Jensen, and J. Tkadlec, “All-pay bidding games on graphs,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 02. Association for the Advancement of Artificial Intelligence, pp. 1798–1805, 2020.
[Preprint] View | DOI | arXiv
 
[38]
2020 | Published | Conference Paper | IST-REx-ID: 7810 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal and perfectly parallel algorithms for on-demand data-flow analysis,” in European Symposium on Programming, Dublin, Ireland, 2020, vol. 12075, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Published | Conference Paper | IST-REx-ID: 6822 | OA
G. Avni, T. A. Henzinger, R. Ibsen-Jensen, and P. Novotny, “Bidding games on Markov decision processes,” in Proceedings of the 13th International Conference of Reachability Problems, Brussels, Belgium, 2019, vol. 11674, pp. 1–12.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Published | Journal Article | IST-REx-ID: 7158 | OA
K. Chatterjee, A. K. Goharshady, P. Goyal, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for dynamic algebraic queries in basic RSMs with constant treewidth,” ACM Transactions on Programming Languages and Systems, vol. 41, no. 4. ACM, 2019.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Published | Conference Paper | IST-REx-ID: 5967 | OA
K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
[Submitted Version] View | Files available | DOI | WoS
 
[33]
2018 | Published | Journal Article | IST-REx-ID: 198 | OA
R. Ibsen-Jensen, J. Tkadlec, K. Chatterjee, and M. Nowak, “Language acquisition with communication between learners,” Journal of the Royal Society Interface, vol. 15, no. 140. The Royal Society, 2018.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[32]
2018 | Published | Conference Paper | IST-REx-ID: 66 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and Y. Velner, “Ergodic mean-payoff games for the analysis of attacks in crypto-currencies,” presented at the CONCUR: Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Published | Journal Article | IST-REx-ID: 6009 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” ACM Transactions on Programming Languages and Systems, vol. 40, no. 3. Association for Computing Machinery, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI
 
[29]
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, “Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[28]
2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
K. Chatterjee, K. Hansen, and R. Ibsen-Jensen, “Strategy complexity of concurrent safety games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[27]
2016 | Published | Conference Paper | IST-REx-ID: 1071 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | Files available | DOI
 
[26]
2016 | Published | Conference Paper | IST-REx-ID: 1340 | OA
K. Hansen, R. Ibsen-Jensen, and M. Koucký, “The big match in small space,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool, United Kingdom, 2016, vol. 9928, pp. 64–76.
[Preprint] View | DOI | Download Preprint (ext.)
 
[25]
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
[Preprint] View | Files available | Download Preprint (ext.)
 
[24]
2016 | Published | Conference Paper | IST-REx-ID: 478 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of a single step of magic: The gathering,” presented at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.
[Published Version] View | Files available | DOI
 
[23]
2016 | Published | Conference Paper | IST-REx-ID: 1437 | OA
K. Chatterjee, A. K. Goharshady, R. Ibsen-Jensen, and A. Pavlogiannis, “Algorithms for algebraic path properties in concurrent systems of constant treewidth components,” presented at the POPL: Principles of Programming Languages, St. Petersburg, FL, USA, 2016, vol. 20–22, pp. 733–747.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Published | Conference Paper | IST-REx-ID: 10796
K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2015, vol. 2015, no. 1, pp. 1018–1029.
[Preprint] View | DOI | arXiv
 
[21]
2015 | Published | Journal Article | IST-REx-ID: 524 | OA
K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[20]
2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[19]
2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[18]
2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[17]
2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[16]
2015 | Published | Technical Report | IST-REx-ID: 5438 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[15]
2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
[Published Version] View | Files available | DOI
 
[14]
2015 | Published | Journal Article | IST-REx-ID: 1559 | OA
R. Ibsen-Jensen, K. Chatterjee, and M. Nowak, “Computational complexity of ecological and evolutionary spatial dynamics,” PNAS, vol. 112, no. 51. National Academy of Sciences, pp. 15636–15641, 2015.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[13]
2015 | Published | Journal Article | IST-REx-ID: 1602 | OA
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[12]
2015 | Published | Conference Paper | IST-REx-ID: 1607 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[11]
2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
View | Files available | DOI | Download None (ext.) | arXiv
 
[10]
2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and 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 | Published | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[8]
2014 | Published | Technical Report | IST-REx-ID: 5420 | OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[7]
2014 | Published | Technical Report | IST-REx-ID: 5421 | OA
K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[6]
2014 | Published | Technical Report | IST-REx-ID: 5427 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 2162 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[4]
2014 | Published | Conference Paper | IST-REx-ID: 2216 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[3]
2013 | Published | Technical Report | IST-REx-ID: 5403 | OA
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[2]
2013 | Published | Technical Report | IST-REx-ID: 5404 | OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
[1]
2013 | Published | Technical Report | IST-REx-ID: 5409 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed