Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.”https://doi.org/10.1371/journal.pcbi.1010149__PLOS Computational Biology. Public Library of Science, 2022.https://doi.org/10.1371/journal.pcbi.1010149 .
LibreCat: https://research-explorer.ista.ac.at/record/12280
DOI: 10.1371/journal.pcbi.1010149
WoS: 000843626800031
PMID: 35700167

Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.”https://doi.org/10.1287/moor.2020.1116__Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022.https://doi.org/10.1287/moor.2020.1116 .
LibreCat: https://research-explorer.ista.ac.at/record/9311
DOI: 10.1287/moor.2020.1116
WoS: 000731918100001
arXiv: 1904.13360

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”https://doi.org/10.1007/978-3-031-19992-9_20__In 20th International Symposium on Automated Technology for Verification and Analysis, 13505:320–26. Springer Nature, 2022.https://doi.org/10.1007/978-3-031-19992-9_20 .
LibreCat: https://research-explorer.ista.ac.at/record/12170
DOI: 10.1007/978-3-031-19992-9_20

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”https://doi.org/10.1016/j.jcss.2022.04.003__Journal of Computer and System Sciences. Elsevier, 2022.https://doi.org/10.1016/j.jcss.2022.04.003 .
LibreCat: https://research-explorer.ista.ac.at/record/11402
DOI: 10.1016/j.jcss.2022.04.003
WoS: 000805002800001
arXiv: 1802.03642

Grover, Kush, Jan Kretinsky, Tobias Meggendorfer, and Maimilian Weininger. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”https://doi.org/10.4230/LIPIcs.CONCUR.2022.11__In 33rd International Conference on Concurrency Theory , Vol. 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.CONCUR.2022.11 .
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”https://doi.org/10.1007/978-3-031-13185-1_4__In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022.https://doi.org/10.1007/978-3-031-13185-1_4 .
LibreCat: https://research-explorer.ista.ac.at/record/12000
DOI: 10.1007/978-3-031-13185-1_4
WoS: 000870304500004

Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”https://doi.org/10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022.https://doi.org/10.1609/aaai.v36i7.20695 .
LibreCat: https://research-explorer.ista.ac.at/record/12511
DOI: 10.1609/aaai.v36i7.20695
arXiv: 2112.09495

Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.”https://doi.org/10.48550/arXiv.2205.11991__ArXiv, n.d.https://doi.org/10.48550/arXiv.2205.11991 .
LibreCat: https://research-explorer.ista.ac.at/record/14601
DOI: 10.48550/arXiv.2205.11991
arXiv: 2205.11991

Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”https://doi.org/10.48550/ARXIV.2210.05308__ArXiv, n.d.https://doi.org/10.48550/ARXIV.2210.05308 .
LibreCat: https://research-explorer.ista.ac.at/record/14600
DOI: 10.48550/ARXIV.2210.05308
arXiv: 2210.05308

Jecker, Ismael R, Nicolas Mazzocchi, and Petra Wolf. “Decomposing Permutation Automata.”https://doi.org/10.4230/LIPIcs.CONCUR.2021.18__In 32nd International Conference on Concurrency Theory, Vol. 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.CONCUR.2021.18 .
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”https://doi.org/10.4230/LIPIcs.ICALP.2021.124__In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 .
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Guha, Shibashis, Ismael R Jecker, Karoliina Lehtinen, and Martin Zimmermann. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”https://doi.org/10.4230/LIPIcs.MFCS.2021.53__In 46th International Symposium on Mathematical Foundations of Computer Science, Vol. 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.MFCS.2021.53 .
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

Arrighi, Emmanuel, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismael R Jecker, Mateus De Oliveira Oliveira, and Petra Wolf. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34__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.34 .
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.”https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42__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 .
LibreCat: https://research-explorer.ista.ac.at/record/10629
DOI: 10.4230/LIPIcs.FSTTCS.2021.42

Avni, Guy, Ismael R Jecker, and Dorde Zikelic. “Infinite-Duration All-Pay Bidding Games.”https://doi.org/10.1137/1.9781611976465.38__In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, 617–36. Society for Industrial and Applied Mathematics, 2021.https://doi.org/10.1137/1.9781611976465.38 .
LibreCat: https://research-explorer.ista.ac.at/record/10694
DOI: 10.1137/1.9781611976465.38
arXiv: 2005.06636

Tomásek, Petr, Karel Horák, Aditya Aradhye, Branislav Bosanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.”https://doi.org/10.24963/ijcai.2021/575__In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021.https://doi.org/10.24963/ijcai.2021/575 .
LibreCat: https://research-explorer.ista.ac.at/record/10847
DOI: 10.24963/ijcai.2021/575

Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.”https://doi.org/10.1007/978-3-030-68211-8_18__In 15th International Conference on Algorithms and Computation, 12635:221–33. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-68211-8_18 .
LibreCat: https://research-explorer.ista.ac.at/record/9296
DOI: 10.1007/978-3-030-68211-8_18
arXiv: 2101.03928

Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/9403

Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.”https://doi.org/10.1007/978-3-030-72016-2__In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-72016-2 .
LibreCat: https://research-explorer.ista.ac.at/record/12767
DOI: 10.1007/978-3-030-72016-2
arXiv: 2101.02594

Lechner, Mathias, Ðore dikeli, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.”https://doi.org/10.48550/arXiv.2111.03165__In 35th Conference on Neural Information Processing Systems, 2021.https://doi.org/10.48550/arXiv.2111.03165 .
LibreCat: https://research-explorer.ista.ac.at/record/10667
DOI: 10.48550/arXiv.2111.03165
arXiv: 2111.03165