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 |
Bentert, M., Ceylan, E., Hübner, V., Schmid, S., & Srba, J. (2026). Fast re-routing in networks: On the complexity of perfect resilience. In 29th International Conference on Principles of Distributed Systems (Vol. 361). Iaşi, Romania: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2025.31
[Published Version]
View
| Files available
| DOI
2026 |
Epub ahead of print |
Journal Article |
IST-REx-ID: 21661 |
Hartmanns, A., Junges, S., Quatmann, T., & Weininger, M. (2026). The revised practitioner’s guide to MDP model checking algorithms. International Journal on Software Tools for Technology Transfer. Springer Nature. https://doi.org/10.1007/s10009-026-00848-y
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2025 |
Published |
Journal Article |
IST-REx-ID: 18529
Zhang, Y., Wang, J., Wen, G., Guan, J., Zhou, S., Chen, G., … Perc, M. (2025). Limitation of time promotes cooperation in structured collaboration systems. IEEE Transactions on Network Science and Engineering. IEEE. https://doi.org/10.1109/TNSE.2024.3481434
View
| DOI
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 19965 |
Mcavoy, A., Sehwag, U. M., Hilbe, C., Chatterjee, K., Barfuss, W., Su, Q., … Plotkin, J. B. (2025). Unilateral incentive alignment in two-agent stochastic games. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2319927121
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2025 |
Published |
Conference Paper |
IST-REx-ID: 20053 |
Chatterjee, K., Gilbert, S., Schmid, S., Svoboda, J., & Yeo, M. X. (2025). When is liquid democracy possible?: On the manipulation of variance. In Proceedings of the ACM Symposium on Principles of Distributed Computing (pp. 241–251). Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733544
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| WoS
2025 |
Published |
Journal Article |
IST-REx-ID: 20254 |
| 
|
Brewster, D. A., Svoboda, J., Roscow, D., Chatterjee, K., Tkadlec, J., & Nowak, M. A. (2025). Maintaining diversity in structured populations. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf252
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20297 |
Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025). Limit-sure reachability for small memory policies in POMDPs is NP-complete. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20299 |
Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard policy iteration for deterministic Markov Decision Processes. In The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de Janeiro, Brazil: ML Research Press.
[Published Version]
View
| Files available
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20302 |
Luo, R., Stich, S. U., Horváth, S., & Takáč, M. (2025). Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis. In The 28th International Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 2539–2547). Mai Khao, Thailand: ML Research Press.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20610
Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). What are the odds? Improving statistical model checking of Markov decision processes. In Second International Joint Conference on QEST+FORMATS (Vol. 16143, pp. 195–218). Aarhus, Denmark: Springer Nature. https://doi.org/10.1007/978-3-032-05792-1_11
View
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 20648 |
Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., Saadat, M., Seeliger, M., & Zikelic, D. (2025). PolyQEnt: A polynomial quantified entailment solver. In 23rd International Symposium on Automated Technology for Verification and Analysis (Vol. 16145, pp. 411–424). Bengaluru, India: Springer Nature. https://doi.org/10.1007/978-3-032-08707-2_19
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20688 |
Grobelna, M., Kretinsky, J., & Weininger, M. (2025). Stopping criteria for value iteration on concurrent stochastic reachability and safety games. In 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 568–580). Singapore, Singapore: IEEE. https://doi.org/10.1109/lics65433.2025.00049
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20689 |
Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2025). Multiplicative rewards in Markovian models. In 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 499–512). Singapore, Singapore: IEEE. https://doi.org/10.1109/lics65433.2025.00044
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20690 |
Brihaye, T., Chatterjee, K., Mohr, S., & Weininger, M. (2025). Risk-aware Markov decision processes using cumulative prospect theory. In 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 458–471). Singapore, Singapore: IEEE. https://doi.org/10.1109/lics65433.2025.00041
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19375 |
Azeem, M., Chakraborty, D., Kanav, S., Kretinsky, J., Mohagheghi, M., Mohr, S., & Weininger, M. (2025). 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 (Vol. 15530, pp. 97–120). Denver, CO, United States: Springer Nature. https://doi.org/10.1007/978-3-031-82703-7_5
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19445 |
Křišťan, J. M., & Svoboda, J. (2025). Reconfiguration using generalized token jumping. In 19th International Conference and Workshops on Algorithms and Computation (Vol. 15411, pp. 244–265). Chengdu, China: Springer Nature. https://doi.org/10.1007/978-981-96-2845-2_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19600 |
Avarikioti, Z., Bastankhah, M., Maddah-Ali, M. A., Pietrzak, K. Z., Svoboda, J., & Yeo, M. X. (2025). Route discovery in private payment channel networks. In Computer Security. ESORICS 2024 International Workshops (Vol. 15263, pp. 207–223). Bydgoszcz, Poland: Springer Nature. https://doi.org/10.1007/978-3-031-82349-7_15
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2025 |
Published |
Conference Paper |
IST-REx-ID: 19666 |
Meggendorfer, T., Weininger, M., & Wienhöft, P. (2025). Solving robust Markov decision processes: Generic, reliable, efficient. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 26631–26641). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i25.34865
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19667 |
Chatterjee, K., Goharshady, E., Karrabi, M., Motwani, H. J., Seeliger, M., & Zikelic, D. (2025). Quantified linear and polynomial arithmetic satisfiability via template-based skolemization. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11158–11166). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33213
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19669 |
Chatterjee, K., Luo, R., Saona Urmeneta, R. J., & Svoboda, J. (2025). Linear equations with min and max operators: Computational complexity. In Proceedings of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11150–11157). Philadelphia, PA, United States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33212
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv