Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
520 Publications
2026 |
Published |
Conference Paper |
IST-REx-ID: 21411 |
M. Bentert, E. Ceylan, V. Hübner, S. Schmid, and J. Srba, “Fast re-routing in networks: On the complexity of perfect resilience,” in 29th International Conference on Principles of Distributed Systems, Iaşi, Romania, 2026, vol. 361.
[Published Version]
View
| Files available
| DOI
2026 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 21661 |
A. Hartmanns, S. Junges, T. Quatmann, and M. Weininger, “The revised practitioner’s guide to MDP model checking algorithms,” International Journal on Software Tools for Technology Transfer. Springer Nature, 2026.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 |
Published |
Journal Article |
IST-REx-ID: 19965 |
A. Mcavoy et al., “Unilateral incentive alignment in two-agent stochastic games,” Proceedings of the National Academy of Sciences, vol. 122, no. 25. National Academy of Sciences, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2025 |
Published |
Conference Paper |
IST-REx-ID: 20053 |
K. Chatterjee, S. Gilbert, S. Schmid, J. Svoboda, and M. X. Yeo, “When is liquid democracy possible?: On the manipulation of variance,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025, pp. 241–251.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 20254 |
| 
|
D. A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, and M. A. Nowak, “Maintaining diversity in structured populations,” PNAS Nexus, vol. 4, no. 8. Oxford University Press, 2025.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20297 |
A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure reachability for small memory policies in POMDPs is NP-complete,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 238–247.
[Published Version]
View
| Files available
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20299 |
A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.
[Published Version]
View
| Files available
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20302 |
R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis,” in The 28th International Conference on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol. 258, pp. 2539–2547.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20610
T. Meggendorfer, M. Weininger, and P. Wienhöft, “What are the odds? Improving statistical model checking of Markov decision processes,” in Second International Joint Conference on QEST+FORMATS, Aarhus, Denmark, 2025, vol. 16143, pp. 195–218.
View
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 20648 |
K. Chatterjee et al., “PolyQEnt: A polynomial quantified entailment solver,” in 23rd International Symposium on Automated Technology for Verification and Analysis, Bengaluru, India, 2025, vol. 16145, pp. 411–424.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20688 |
M. Grobelna, J. Kretinsky, and M. Weininger, “Stopping criteria for value iteration on concurrent stochastic reachability and safety games,” in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, Singapore, Singapore, 2025, pp. 568–580.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20689 |
C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Multiplicative rewards in Markovian models,” in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, Singapore, Singapore, 2025, pp. 499–512.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20690 |
T. Brihaye, K. Chatterjee, S. Mohr, and M. Weininger, “Risk-aware Markov decision processes using cumulative prospect theory,” in 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, Singapore, Singapore, 2025, pp. 458–471.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19375 |
M. Azeem et al., “1–2–3–Go! Policy synthesis for parameterized Markov decision processes via decision-tree learning and generalization,” in 26th International Conference on Verification, Model Checking, and Abstract Interpretation, Denver, CO, United States, 2025, vol. 15530, pp. 97–120.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19445 |
J. M. Křišťan and J. Svoboda, “Reconfiguration using generalized token jumping,” in 19th International Conference and Workshops on Algorithms and Computation, Chengdu, China, 2025, vol. 15411, pp. 244–265.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19600 |
Z. Avarikioti, M. Bastankhah, M. A. Maddah-Ali, K. Z. Pietrzak, J. Svoboda, and M. X. Yeo, “Route discovery in private payment channel networks,” in Computer Security. ESORICS 2024 International Workshops, Bydgoszcz, Poland, 2025, vol. 15263, pp. 207–223.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2025 |
Published |
Conference Paper |
IST-REx-ID: 19666 |
T. Meggendorfer, M. Weininger, and P. Wienhöft, “Solving robust Markov decision processes: Generic, reliable, efficient,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 25, pp. 26631–26641.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19667 |
K. Chatterjee, E. Goharshady, M. Karrabi, H. J. Motwani, M. Seeliger, and D. Zikelic, “Quantified linear and polynomial arithmetic satisfiability via template-based skolemization,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19669 |
K. Chatterjee, R. Luo, R. J. Saona Urmeneta, and J. Svoboda, “Linear equations with min and max operators: Computational complexity,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11150–11157.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv