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.
534 Publications
2022 |
Published |
Journal Article |
IST-REx-ID: 10731 |
Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 2022;12(1). doi:10.1038/s41598-022-05333-5
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2022 |
Published |
Conference Paper |
IST-REx-ID: 12775 |
Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11
[Published Version]
View
| Files available
| DOI
| arXiv
2022 |
Published |
Conference Paper |
IST-REx-ID: 12101 |
Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11
[Published Version]
View
| Files available
| DOI
2022 |
Published |
Journal Article |
IST-REx-ID: 12257 |
Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 2022;106(3). doi:10.1103/physreve.106.034321
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2022 |
Published |
Journal Article |
IST-REx-ID: 9311 |
Chatterjee K, Saona Urmeneta RJ, Ziliotto B. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 2022;47(1):100-119. doi:10.1287/moor.2020.1116
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10847 |
Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: 30th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575
[Published Version]
View
| DOI
| Download Published Version (ext.)
2021 |
Published |
Conference Paper |
IST-REx-ID: 12767 |
Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In: 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12651. Springer Nature; 2021:20-37. doi:10.1007/978-3-030-72016-2_2
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Research Data Reference |
IST-REx-ID: 15284 |
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. RevTerm. 2021. doi:10.1145/3410304
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2021 |
Published |
Conference Paper |
IST-REx-ID: 10052 |
Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10054 |
Chatterjee K, Henzinger M, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Conference Paper |
IST-REx-ID: 10055 |
Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44
[Published Version]
View
| Files available
| DOI
| WoS
2021 |
Published |
Conference Paper |
IST-REx-ID: 10075 |
Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 10191 |
Bui TL, Chatterjee K, Gautam T, Pavlogiannis A, Toman V. The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. 2021;5(OOPSLA). doi:10.1145/3485541
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Thesis | PhD |
IST-REx-ID: 10199 |
Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
[Published Version]
View
| Files available
| DOI
earlier version | 2021 |
Published |
Conference Paper |
IST-REx-ID: 10414 |
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10629 |
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42
[Published Version]
View
| Files available
| DOI
2021 |
Published |
Conference Paper |
IST-REx-ID: 10630 |
Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |
Published |
Conference Paper |
IST-REx-ID: 10694 |
Avni G, Jecker IR, Zikelic D. Infinite-duration all-pay bidding games. In: Marx D, ed. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:617-636. doi:10.1137/1.9781611976465.38
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |
Published |
Journal Article |
IST-REx-ID: 8793 |
Zeiner M, Schmid U, Chatterjee K. Optimal strategies for selecting coordinators. Discrete Applied Mathematics. 2021;289(1):392-415. doi:10.1016/j.dam.2020.10.022
[Published Version]
View
| Files available
| DOI
| WoS
earlier version | 2021 |
Published |
Conference Paper |
IST-REx-ID: 9296 |
Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv