Rasmus Ibsen-Jensen

Chatterjee Group

44 Publications

Mark all

[44]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version] View | Files available | DOI
 
[43]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[42]
2021 | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.
[Published Version] View | Files available | DOI | arXiv
 
[40]
2020 | Journal Article | IST-REx-ID: 9197
Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.
[Preprint] View | DOI | arXiv
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin 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. https://doi.org/10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[38]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham 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, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.
[Submitted Version] View | Files available | DOI | WoS
 
[33]
2018 | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[32]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
[Published Version] View | Files available | DOI
 
[29]
2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
[Published Version] View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
[Preprint] View | Files available | Download Preprint (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340 | OA
Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_6.
[Preprint] View | DOI | Download Preprint (ext.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[23]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Conference Paper | IST-REx-ID: 10796
Chatterjee, Krishnendu, and Rasmus 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, 2015:1018–29. SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
[Preprint] View | DOI | arXiv
 
[21]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[20]
2015 | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[19]
2015 | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[18]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI | Download None (ext.) | arXiv
 
[17]
2015 | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[15]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[14]
2015 | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[13]
2015 | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[12]
2015 | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[10]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[8]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[6]
2014 | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[5]
2014 | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[4]
2014 | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed

44 Publications

Mark all

[44]
2022 | Conference Paper | IST-REx-ID: 12101 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11.
[Published Version] View | Files available | DOI
 
[43]
2021 | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.” In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42.
[Published Version] View | Files available | DOI
 
[42]
2021 | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.” Formal Methods in System Design. Springer, 2021. https://doi.org/10.1007/s10703-021-00373-5.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[41]
2020 | Conference Paper | IST-REx-ID: 8533 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.” In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. https://doi.org/10.4230/LIPIcs.MFCS.2020.22.
[Published Version] View | Files available | DOI | arXiv
 
[40]
2020 | Journal Article | IST-REx-ID: 9197
Avni, Guy, Rasmus Ibsen-Jensen, and Josef Tkadlec. “All-Pay Bidding Games on Graphs.” Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020. https://doi.org/10.1609/aaai.v34i02.5546.
[Preprint] View | DOI | arXiv
 
[39]
2020 | Research Data Reference | IST-REx-ID: 9814 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin 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. https://doi.org/10.6084/m9.figshare.5973013.v1.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[38]
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.” In European Symposium on Programming, 12075:112–40. Springer Nature, 2020. https://doi.org/10.1007/978-3-030-44914-8_5.
[Published Version] View | Files available | DOI | WoS
 
[37]
2019 | Conference Paper | IST-REx-ID: 6822 | OA
Avni, Guy, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Petr Novotny. “Bidding Games on Markov Decision Processes.” In Proceedings of the 13th International Conference of Reachability Problems, 11674:1–12. Springer, 2019. https://doi.org/10.1007/978-3-030-30806-3_1.
[Submitted Version] View | Files available | DOI
 
[36]
2019 | Journal Article | IST-REx-ID: 7158 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version] View | Files available | DOI | WoS
 
[35]
2018 | Conference Paper | IST-REx-ID: 5788 | OA
Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. https://doi.org/10.1007/978-3-030-04612-5_2.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[34]
2018 | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham 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, 149–50. ACM Press, 2018. https://doi.org/10.1145/3219166.3219198.
[Submitted Version] View | Files available | DOI | WoS
 
[33]
2018 | Journal Article | IST-REx-ID: 198 | OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
[32]
2018 | Conference Paper | IST-REx-ID: 66 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
[Published Version] View | Files available | DOI | arXiv
 
[31]
2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018. https://doi.org/10.1145/3210257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[30]
2017 | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
[Published Version] View | Files available | DOI
 
[29]
2017 | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
[Published Version] View | Files available | DOI
 
[28]
2017 | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1182 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.
[Preprint] View | Files available | Download Preprint (ext.)
 
[26]
2016 | Conference Paper | IST-REx-ID: 1340 | OA
Hansen, Kristoffer, Rasmus Ibsen-Jensen, and Michal Koucký. “The Big Match in Small Space,” 9928:64–76. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_6.
[Preprint] View | DOI | Download Preprint (ext.)
 
[25]
2016 | Conference Paper | IST-REx-ID: 478 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016. https://doi.org/10.3233/978-1-61499-672-9-1432.
[Published Version] View | Files available | DOI
 
[24]
2016 | Conference Paper | IST-REx-ID: 1071 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. https://doi.org/10.4230/LIPIcs.ESA.2016.28.
[Published Version] View | Files available | DOI
 
[23]
2016 | Conference Paper | IST-REx-ID: 1437 | OA
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,” 20–22:733–47. ACM, 2016. https://doi.org/10.1145/2837614.2837624.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2015 | Conference Paper | IST-REx-ID: 10796
Chatterjee, Krishnendu, and Rasmus 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, 2015:1018–29. SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
[Preprint] View | DOI | arXiv
 
[21]
2015 | Journal Article | IST-REx-ID: 1559 | OA
Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1511366112.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
[20]
2015 | Journal Article | IST-REx-ID: 524 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.009.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[19]
2015 | Technical Report | IST-REx-ID: 5431 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-322-v1-1.
[Published Version] View | Files available | DOI
 
[18]
2015 | Conference Paper | IST-REx-ID: 1610 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
View | Files available | DOI | Download None (ext.) | arXiv
 
[17]
2015 | Technical Report | IST-REx-ID: 5437 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
[Published Version] View | Files available | DOI
 
[16]
2015 | Technical Report | IST-REx-ID: 5430 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-319-v1-1.
[Published Version] View | Files available | DOI
 
[15]
2015 | Technical Report | IST-REx-ID: 5438 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
[Published Version] View | Files available | DOI
 
[14]
2015 | Technical Report | IST-REx-ID: 5440 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
[Published Version] View | Files available | DOI
 
[13]
2015 | Technical Report | IST-REx-ID: 5432 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v1-1.
[Published Version] View | Files available | DOI
 
[12]
2015 | Journal Article | IST-REx-ID: 1602 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.” ACM SIGPLAN Notices. ACM, 2015. https://doi.org/10.1145/2676726.2676979.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[11]
2015 | Conference Paper | IST-REx-ID: 1607 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,” 9206:140–57. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_9.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
[10]
2015 | Technical Report | IST-REx-ID: 5441 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
[Published Version] View | Files available | DOI
 
[9]
2014 | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[8]
2014 | Conference Paper | IST-REx-ID: 2216 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,” 303–12. Springer, 2014. https://doi.org/10.1145/2562059.2562141.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5419 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-187-v1-1.
[Published Version] View | Files available | DOI
 
[6]
2014 | Technical Report | IST-REx-ID: 5420 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-191-v1-1.
[Published Version] View | Files available | DOI
 
[5]
2014 | Technical Report | IST-REx-ID: 5427 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-314-v1-1.
[Published Version] View | Files available | DOI
 
[4]
2014 | Technical Report | IST-REx-ID: 5421 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014. https://doi.org/10.15479/AT:IST-2014-190-v2-2.
[Published Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5403 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-126-v1-1.
[Published Version] View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5404 | OA
Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-127-v1-1.
[Published Version] View | Files available | DOI
 
[1]
2013 | Technical Report | IST-REx-ID: 5409 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013. https://doi.org/10.15479/AT:IST-2013-144-v1-1.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: Chicago

    Export / Embed