Svoboda, Jakub, et al. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.”10.1038/s41598-022-05333-5__Scientific Reports, vol. 12, no. 1, 1526, Springer Nature, 2022, doi:10.1038/s41598-022-05333-5.

Zikelic, Dorde, et al. “Differential Cost Analysis with Simultaneous Potentials and Anti-Potentials.”10.1145/3519939.3523435__Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–57, doi:10.1145/3519939.3523435.

Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.”10.1103/physreve.106.034321__Physical Review E, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:10.1103/physreve.106.034321.

Schmid, Laura, et al. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.”10.1371/journal.pcbi.1010149__PLOS Computational Biology, vol. 18, no. 6, e1010149, Public Library of Science, 2022, doi:10.1371/journal.pcbi.1010149.

Chatterjee, Krishnendu, et al. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.”10.1287/moor.2020.1116__Mathematics of Operations Research, vol. 47, no. 1, Institute for Operations Research and the Management Sciences, 2022, pp. 100–19, doi:10.1287/moor.2020.1116.

Meggendorfer, Tobias. “PET – A Partial Exploration Tool for Probabilistic Verification.”10.1007/978-3-031-19992-9_20__20th International Symposium on Automated Technology for Verification and Analysis, vol. 13505, Springer Nature, 2022, pp. 320–26, doi:10.1007/978-3-031-19992-9_20.

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”10.1016/j.jcss.2022.04.003__Journal of Computer and System Sciences, vol. 129, Elsevier, 2022, pp. 1–21, doi:10.1016/j.jcss.2022.04.003.

Grover, Kush, et al. “Anytime Guarantees for Reachability in Uncountable Markov Decision Processes.”10.4230/LIPIcs.CONCUR.2022.11__33rd International Conference on Concurrency Theory , vol. 243, 11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:10.4230/LIPIcs.CONCUR.2022.11.

Chatterjee, Krishnendu, et al. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”10.1007/978-3-031-13185-1_4__Proceedings of the 34th International Conference on Computer Aided Verification, vol. 13371, Springer, 2022, pp. 55–78, doi:10.1007/978-3-031-13185-1_4.

Lechner, Mathias, et al. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7, Association for the Advancement of Artificial Intelligence, 2022, pp. 7326–36, doi:10.1609/aaai.v36i7.20695.

Zikelic, Dorde, et al. “Learning Stabilizing Policies in Stochastic Control Systems.”10.48550/arXiv.2205.11991__ArXiv, doi:10.48550/arXiv.2205.11991.

Zikelic, Dorde, et al. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”10.48550/ARXIV.2210.05308__ArXiv, doi:10.48550/ARXIV.2210.05308.

Jecker, Ismael R., et al. “Decomposing Permutation Automata.”10.4230/LIPIcs.CONCUR.2021.18__32nd International Conference on Concurrency Theory, vol. 203, 18, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.CONCUR.2021.18.

Chatterjee, Krishnendu, et al. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”10.4230/LIPIcs.ICALP.2021.124__48th International Colloquium on Automata, Languages, and Programming, vol. 198, 124, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ICALP.2021.124.

Guha, Shibashis, et al. “A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.”10.4230/LIPIcs.MFCS.2021.53__46th International Symposium on Mathematical Foundations of Computer Science, vol. 202, 53, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.MFCS.2021.53.

Arrighi, Emmanuel, et al. “On the Complexity of Intersection Non-Emptiness for Star-Free Language Classes.”10.4230/LIPIcs.FSTTCS.2021.34__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 34, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.34.

Chatterjee, Krishnendu, et al. “Quantitative Verification on Product Graphs of Small Treewidth.”10.4230/LIPIcs.FSTTCS.2021.42__41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 213, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.FSTTCS.2021.42.

Avni, Guy, et al. “Infinite-Duration All-Pay Bidding Games.”10.1137/1.9781611976465.38__Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, edited by Dániel Marx, Society for Industrial and Applied Mathematics, 2021, pp. 617–36, doi:10.1137/1.9781611976465.38.

Tomásek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.”10.24963/ijcai.2021/575__30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.

Aichholzer, Oswin, et al. “On Compatible Matchings.”10.1007/978-3-030-68211-8_18__15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.