Artefact for: Correct Approximation of Stationary Distributions
T. Meggendorfer, (2023).

Compositional policy learning in stochastic control systems with formal guarantees
D. Zikelic, M. Lechner, A. Verma, K. Chatterjee, T.A. Henzinger, in:, 37th Conference on Neural Information Processing Systems, 2023.

On lexicographic proof rules for probabilistic termination
K. Chatterjee, E. Kafshdar Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, Formal Aspects of Computing 35 (2023).

Prophet inequalities: Separating random order from order selection
G. Giambartolomei, F.M.-T. Frederik Mallmann-Trenn, R.J. Saona Urmeneta, ArXiv (n.d.).

Algorithms and hardness results for computing cores of Markov chains
A. Ahmadi, K. Chatterjee, A.K. Goharshady, T. Meggendorfer, R. Safavi Hemami, D. Zikelic, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Complexity of spatial games
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Risk-aware stochastic shortest path
T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.

Repeated prophet inequality with near-optimal bounds
K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).

Index appearance record with preorders
J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618.

Infection dynamics of COVID-19 virus under lockdown and reopening
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Scientific Reports 12 (2022).

Differential cost analysis with simultaneous potentials and anti-potentials
D. Zikelic, B.-Y.E. Chang, P. Bolignano, F. Raimondi, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–457.

Social balance on networks: Local minima and best-edge dynamics
K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022).

Direct reciprocity between individuals that use different strategy spaces
L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022).

Finite-memory strategies in POMDPs with long-run average objectives
K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.

PET – A partial exploration tool for probabilistic verification
T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.

Graph planning with expected finite horizon
K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.

Anytime guarantees for reachability in uncountable Markov decision processes
K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.

Sound and complete certificates for auantitative termination analysis of probabilistic programs
K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78.

Stability verification in stochastic control systems via neural network supermartingales
M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.