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.
459 Publications
2023 | Conference Paper | IST-REx-ID: 14830
D. Zikelic, M. Lechner, T. A. Henzinger, and K. Chatterjee, “Learning control policies for stochastic systems with reach-avoid guarantees,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, United States, 2023, vol. 37, no. 10, pp. 11926–11935.
[Preprint]
View
| Files available
| DOI
| arXiv
2023 | Conference Paper | IST-REx-ID: 13139 | 
T. Meggendorfer, “Correct approximation of stationary distributions,” in TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13993, pp. 489–507.
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Research Data Reference | IST-REx-ID: 14990 |
T. Meggendorfer, “Artefact for: Correct Approximation of Stationary Distributions.” Zenodo, 2023.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2023 | Conference Paper | IST-REx-ID: 15023 |
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.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2022 | Conference Paper | IST-REx-ID: 12102 |
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.
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12101 |
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.
[Published Version]
View
| Files available
| DOI
2022 | Conference Paper | IST-REx-ID: 12568 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 11938 |
O. Aichholzer et al., “On compatible matchings,” Journal of Graph Algorithms and Applications, vol. 26, no. 2. Brown University, pp. 225–240, 2022.
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Preprint | IST-REx-ID: 12677 |
K. Chatterjee, M. Mohammadi, and R. J. Saona Urmeneta, “Repeated prophet inequality with near-optimal bounds,” arXiv. .
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Journal Article | IST-REx-ID: 10602 |
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica, vol. 59. Springer Nature, pp. 585–618, 2022.
[Published Version]
View
| Files available
| DOI
| WoS