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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

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.

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 .

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 .

Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.”https://doi.org/10.1016/j.dam.2020.10.022__Discrete Applied Mathematics. Elsevier, 2021.https://doi.org/10.1016/j.dam.2020.10.022 .

Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.”https://doi.org/10.1371/journal.pcbi.1008523__PLoS Computational Biology. Public Library of Science, 2021.https://doi.org/10.1371/journal.pcbi.1008523 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.”https://doi.org/10.1038/s41467-021-24271-w__Nature Communications. Springer Nature, 2021.https://doi.org/10.1038/s41467-021-24271-w .

Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”https://doi.org/10.1145/3453483.3454102__In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021.https://doi.org/10.1145/3453483.3454102 .

Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.”https://doi.org/10.1145/3453483.3454076__In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021.https://doi.org/10.1145/3453483.3454076 .

Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.”https://doi.org/10.1109/LICS52264.2021.9470739__In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021.https://doi.org/10.1109/LICS52264.2021.9470739 .

Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”https://doi.org/10.1109/LICS52264.2021.9470595__In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021.https://doi.org/10.1109/LICS52264.2021.9470595 .