Zikelic, D., Lechner, M., Henzinger, T. A., &; Chatterjee, K. (2023). Learning control policies for stochastic systems with reach-avoid guarantees. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (Vol. 37, pp. 11926–11935). Washington, DC, United States: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v37i10.26407 

Meggendorfer, T. (2023). Correct approximation of stationary distributions. In TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13993, pp. 489–507). Paris, France: Springer Nature.https://doi.org/10.1007/978-3-031-30823-9_25 

Meggendorfer, T. (2023). Artefact for: Correct Approximation of Stationary Distributions. Zenodo.https://doi.org/10.5281/ZENODO.7548214 

Zikelic, D., Lechner, M., Verma, A., Chatterjee, K., &; Henzinger, T. A. (2023). Compositional policy learning in stochastic control systems with formal guarantees. In 37th Conference on Neural Information Processing Systems. New Orleans, LO, United States.

Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., &; Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 

Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &; Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 

Meggendorfer, T. (2022). Risk-aware stochastic shortest path. In Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022 (Vol. 36, pp. 9858–9867). Virtual: Association for the Advancement of Artificial Intelligence.https://doi.org/10.1609/aaai.v36i9.21222 

Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A.,https://doi.org/10.7155/jgaa.00591__Vogtenhuber, B. (2022). On compatible matchings. Journal of Graph Algorithms and Applications. Brown University.https://doi.org/10.7155/jgaa.00591 

Chatterjee, K., Mohammadi, M., &; Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv.https://doi.org/10.48550/ARXIV.2209.14368 

Kretinsky, J., Meggendorfer, T., Waldmann, C., &; Weininger, M. (2022). Index appearance record with preorders. Acta Informatica. Springer Nature.https://doi.org/10.1007/s00236-021-00412-y 

Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., &; Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature.https://doi.org/10.1038/s41598-022-05333-5 

Zikelic, D., Chang, B.-Y. E., Bolignano, P., &; Raimondi, F. (2022). Differential cost analysis with simultaneous potentials and anti-potentials. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 442–457). San Diego, CA, United States: Association for Computing Machinery.https://doi.org/10.1145/3519939.3523435 

Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., &; Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E. American Physical Society.https://doi.org/10.1103/physreve.106.034321 

Schmid, L., Hilbe, C., Chatterjee, K., &; Nowak, M. (2022). Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1010149 

Chatterjee, K., Saona Urmeneta, R. J., &; Ziliotto, B. (2022). Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. Institute for Operations Research and the Management Sciences.https://doi.org/10.1287/moor.2020.1116 

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 

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 

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 

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 

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