Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation
S. Schmid, J. Svoboda, M.X. Yeo, in:, SIROCCO 2023: Structural Information and Communication Complexity , Springer Nature, 2023, pp. 576–594.

Evolutionary dynamics of mutants that modify population structure
J. Tkadlec, K. Kaveh, K. Chatterjee, M.A. Nowak, Journal of the Royal Society, Interface 20 (2023).

The effect of environmental information on evolution of cooperation in stochastic games
M. Kleshnina, C. Hilbe, S. Simsa, K. Chatterjee, M.A. Nowak, Nature Communications 14 (2023).

kleshnina/stochgames_info: The effect of environmental information on evolution of cooperation in stochastic games
M. Kleshnina, (2023).

Stopping criteria for value iteration on stochastic games with quantitative objectives
J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 38th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2023.

Token swapping on trees
A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, Discrete Mathematics and Theoretical Computer Science 24 (2023).

: Boosting liquidity in payment channel networks with online admission control
M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.

Automated verification and control of infinite state stochastic systems
D. Zikelic, Automated Verification and Control of Infinite State Stochastic Systems, Institute of Science and Technology Austria, 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).

Shortest dominating set reconfiguration under token sliding
J.M. Kisan, J. Svoboda, in:, 24th International Symposium on Fundamentals of Computation Theory, Springer Nature, 2023, pp. 333–347.

Learning control policies for stochastic systems with reach-avoid guarantees
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, in:, Proceedings of the 37th AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence, 2023, pp. 11926–11935.

Correct approximation of stationary distributions
T. Meggendorfer, in:, TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 489–507.

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.

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.