Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
397 Publications
2022 | Journal Article | IST-REx-ID: 10731 | 
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Infection dynamics of COVID-19 virus under lockdown and reopening,” Scientific Reports, vol. 12, no. 1. Springer Nature, 2022.
View
| Files available
| DOI
| arXiv
2022 | Journal Article | IST-REx-ID: 10770 |
T. Graham, M. Kleshnina, and J. A. Filar, “Where do mistakes lead? A survey of games with incompetent players,” Dynamic Games and Applications. Springer Nature; Birkhäuser, 2022.
View
| Files available
| DOI
2022 | Journal Article | IST-REx-ID: 9311 |
K. Chatterjee, R. J. Saona Urmeneta, and B. Ziliotto, “Finite-memory strategies in POMDPs with long-run average objectives,” Mathematics of Operations Research, vol. 47, no. 1. Institute for Operations Research and the Management Sciences, pp. 100–119, 2022.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10602 |
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record with preorders,” Acta Informatica. Springer Science and Business Media LLC, 2021.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10629 |
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Quantitative verification on product graphs of small treewidth,” in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, 2021, vol. 213.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10630 |
E. Arrighi 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, Virtual, 2021, vol. 213.
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10694 |
G. Avni, I. R. Jecker, and D. Zikelic, “Infinite-duration all-pay bidding games,” in Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Virtual, 2021, pp. 617–636.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10847 |
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189.
View
| DOI
| Download Published Version (ext.)
2021 | Journal Article | IST-REx-ID: 8793 |
M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10002 |
K. Chatterjee, W. Dvorak, M. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Conference Paper | IST-REx-ID: 10004 |
K. Chatterjee and L. Doyen, “Stochastic processes with expected stopping time,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 10191 |
T. L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, and V. Toman, “The reads-from equivalence for the TSO and PSO memory models,” Proceedings of the ACM on Programming Languages, vol. 5, no. OOPSLA. Association for Computing Machinery, 2021.
View
| Files available
| DOI
| arXiv
2021 | Thesis | IST-REx-ID: 10293
L. Schmid, “Evolution of cooperation via (in)direct reciprocity under imperfect information,” IST Austria, 2021.
View
| Files available
| DOI
2021 | Conference Paper | IST-REx-ID: 10414 |
K. Chatterjee, E. K. Goharshady, P. Novotný, J. Zárevúcky, and Đ. Žikelić, “On lexicographic proof rules for probabilistic termination,” in 24th International Symposium on Formal Methods, Virtual, 2021, vol. 13047, pp. 619–639.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9293
K. Chatterjee, W. Dvořák, M. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 9296 |
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Journal Article | IST-REx-ID: 9402
L. Schmid, K. Chatterjee, C. Hilbe, and M. A. Nowak, “A unified framework of direct and indirect reciprocity,” Nature Human Behaviour. Springer Nature, 2021.
View
| Files available
| DOI
2021 | Book Chapter | IST-REx-ID: 9403 |
L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.
View
| Download Published Version (ext.)
2021 | Journal Article | IST-REx-ID: 9640 |
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, and M. A. Nowak, “Fast and strong amplifiers of natural selection,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.
View
| Files available
| DOI
| PubMed | Europe PMC