Meggendorfer, T. (2022). PET – A partial exploration tool for probabilistic verification. In 20th International Symposium on Automated Technology for Verification and Analysis (Vol. 13505, pp. 320–326). Virtual: Springer Nature.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, K., &; Doyen, L. (2022). Graph planning with expected finite horizon. Journal of Computer and System Sciences. Elsevier.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, K., Kretinsky, J., Meggendorfer, T., &; Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory  (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.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, K., Goharshady, A. K., Meggendorfer, T., &; Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer.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, M., Zikelic, D., Chatterjee, K., &; Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence.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, D., Lechner, M., Chatterjee, K., &; Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv.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, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv.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, I. R., Mazzocchi, N., &; Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik.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, K., Henzinger, M. H., Kale, S. S., &; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik.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, S., Jecker, I. R., Lehtinen, K., &; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik.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, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &; Wolf, P. (2021). On the complexity of intersection non-emptiness for star-free language classes. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.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, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.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, G., Jecker, I. R., &; Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics.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, P., Horák, K., Aradhye, A., Bosanský, B., &; Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence.https://doi.org/10.24963/ijcai.2021/575 
LibreCat: https://research-explorer.ista.ac.at/record/10847
DOI: 10.24963/ijcai.2021/575

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.1007/978-3-030-68211-8_18__Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature.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, L., &; Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig &; C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.
LibreCat: https://research-explorer.ista.ac.at/record/9403

Bansal, S., Chatterjee, K., &; Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature.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, M., dikeli, Ð., Chatterjee, K., &; Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual.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

Zeiner, M., Schmid, U., &; Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier.https://doi.org/10.1016/j.dam.2020.10.022 
LibreCat: https://research-explorer.ista.ac.at/record/8793
DOI: 10.1016/j.dam.2020.10.022
WoS: 000596823800035

Kleshnina, M., Streipert, S. S., Filar, J. A., &; Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1008523 
LibreCat: https://research-explorer.ista.ac.at/record/9381
DOI: 10.1371/journal.pcbi.1008523
WoS: 000639711200001