T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14990
DOI: 10.5281/ZENODO.7548214

D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, and T. A. Henzinger, “Compositional policy learning in stochastic control systems with formal guarantees,” in 37th Conference on Neural Information Processing Systems, New Orleans, LO, United States, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/15023
arXiv: 2312.01456

K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, and D. Zikelic, “On lexicographic proof rules for probabilistic termination,” Formal Aspects of Computing, vol. 35, no. 2. Association for Computing Machinery, 2023.
LibreCat: https://research-explorer.ista.ac.at/record/14778
DOI: 10.1145/3585391
arXiv: 2108.02188

G. Giambartolomei, F. M.-T. Frederik Mallmann-Trenn, and R. J. Saona Urmeneta, “Prophet inequalities: Separating random order from order selection,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/17100
DOI: 10.48550/arXiv.2304.04024
arXiv: 2304.04024

A. Ahmadi, K. Chatterjee, A. K. Goharshady, T. Meggendorfer, R. Safavi Hemami, and D. Zikelic, “Algorithms and hardness results for computing cores of Markov chains,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
LibreCat: https://research-explorer.ista.ac.at/record/12102
DOI: 10.4230/LIPIcs.FSTTCS.2022.29

K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Madras, India, 2022, vol. 250.
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.2022.11

T. Meggendorfer, “Risk-aware stochastic shortest path,” in Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Virtual, 2022, vol. 36, no. 9, pp. 9858–9867.
LibreCat: https://research-explorer.ista.ac.at/record/12568
DOI: 10.1609/aaai.v36i9.21222
arXiv: 2203.01640

O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11938
DOI: 10.7155/jgaa.00591
arXiv: 2101.03928

K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .
LibreCat: https://research-explorer.ista.ac.at/record/12677
DOI: 10.48550/ARXIV.2209.14368
arXiv: 2209.14368

J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/10602
DOI: 10.1007/s00236-021-00412-y
WoS: 000735765500001

J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/10731
DOI: 10.1038/s41598-022-05333-5
WoS: 000749198000039
arXiv: 2012.15155

D. Zikelic, B.-Y. E. Chang, P. Bolignano, and F. Raimondi, “Differential cost analysis with simultaneous potentials and anti-potentials,” in Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, United States, 2022, pp. 442–457.
LibreCat: https://research-explorer.ista.ac.at/record/11459
DOI: 10.1145/3519939.3523435
WoS: 000850435600030
arXiv: 2204.00870

K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” Physical Review E, vol. 106, no. 3. American Physical Society, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12257
DOI: 10.1103/physreve.106.034321
WoS: 000870243100001
arXiv: 2210.02394

L. Schmid, C. Hilbe, K. Chatterjee, and M. Nowak, “Direct reciprocity between individuals that use different strategy spaces,” PLOS Computational Biology, vol. 18, no. 6. Public Library of Science, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12280
DOI: 10.1371/journal.pcbi.1010149
WoS: 000843626800031
PMID: 35700167

K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/9311
DOI: 10.1287/moor.2020.1116
WoS: 000731918100001
arXiv: 1904.13360

T. Meggendorfer, “PET – A partial exploration tool for probabilistic verification,” in 20th International Symposium on Automated Technology for Verification and Analysis, Virtual, 2022, vol. 13505, pp. 320–326.
LibreCat: https://research-explorer.ista.ac.at/record/12170
DOI: 10.1007/978-3-031-19992-9_20

K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” Journal of Computer and System Sciences, vol. 129. Elsevier, pp. 1–21, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/11402
DOI: 10.1016/j.jcss.2022.04.003
WoS: 000805002800001
arXiv: 1802.03642

K. Grover, J. Kretinsky, T. Meggendorfer, and M. Weininger, “Anytime guarantees for reachability in uncountable Markov decision processes,” in 33rd International Conference on Concurrency Theory , Warsaw, Poland, 2022, vol. 243.
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

K. Chatterjee, A. K. Goharshady, T. Meggendorfer, and D. Zikelic, “Sound and complete certificates for auantitative termination analysis of probabilistic programs,” in Proceedings of the 34th International Conference on Computer Aided Verification, Haifa, Israel, 2022, vol. 13371, pp. 55–78.
LibreCat: https://research-explorer.ista.ac.at/record/12000
DOI: 10.1007/978-3-031-13185-1_4
WoS: 000870304500004

M. Lechner, D. Zikelic, K. Chatterjee, and T. A. Henzinger, “Stability verification in stochastic control systems via neural network supermartingales,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, no. 7. Association for the Advancement of Artificial Intelligence, pp. 7326–7336, 2022.
LibreCat: https://research-explorer.ista.ac.at/record/12511
DOI: 10.1609/aaai.v36i7.20695
arXiv: 2112.09495