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.
454 Publications
2021 | Published | Journal Article | IST-REx-ID: 9640 | 
Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2021). Fast and strong amplifiers of natural selection. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-24271-w
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Published | Journal Article | IST-REx-ID: 9381 |
Kleshnina, M., Streipert, S. S., Filar, J. A., & Chatterjee, K. (2021). Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1008523
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10054 |
Chatterjee, K., Henzinger, M. H., Kale, S. S., & Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2021.124
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10002 |
Chatterjee, K., Dvorak, W., Henzinger, M. H., & Svozil, A. (2021). Symbolic time and space tradeoffs for probabilistic verification. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470739
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9646 |
Wang, J., Sun, Y., Fu, H., Chatterjee, K., & Goharshady, A. K. (2021). Quantitative analysis of assertion violations in probabilistic programs. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1171–1186). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454102
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10004 |
Chatterjee, K., & Doyen, L. (2021). Stochastic processes with expected stopping time. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). Rome, Italy: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/LICS52264.2021.9470595
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9645 |
Asadi, A., Chatterjee, K., Fu, H., Goharshady, A. K., & Mahdavi, M. (2021). Polynomial reachability witnesses via Stellensätze. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 772–787). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454076
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 9644 |
Chatterjee, K., Goharshady, E. K., Novotný, P., & Zikelic, D. (2021). Proving non-termination by program reversal. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (pp. 1033–1048). Online: Association for Computing Machinery. https://doi.org/10.1145/3453483.3454093
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Thesis | IST-REx-ID: 10293 |
Schmid, L. (2021). Evolution of cooperation via (in)direct reciprocity under imperfect information. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10293
[Published Version]
View
| Files available
| DOI
2021 | Published | Journal Article | IST-REx-ID: 9997 |
Schmid, L., Shati, P., Hilbe, C., & Chatterjee, K. (2021). The evolution of indirect reciprocity under action and assessment generosity. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-021-96932-1
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Published | Conference Paper | IST-REx-ID: 10414 |
Chatterjee, K., Goharshady, E. K., Novotný, P., Zárevúcky, J., & Zikelic, D. (2021). On lexicographic proof rules for probabilistic termination. In 24th International Symposium on Formal Methods (Vol. 13047, pp. 619–639). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-90870-6_33
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9402 |
Schmid, L., Chatterjee, K., Hilbe, C., & Nowak, M. A. (2021). A unified framework of direct and indirect reciprocity. Nature Human Behaviour. Springer Nature. https://doi.org/10.1038/s41562-021-01114-8
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Published | Conference Paper | IST-REx-ID: 10667 |
Lechner, M., Žikelić, Ð., Chatterjee, K., & Henzinger, T. A. (2021). Infinite time horizon safety of Bayesian neural networks. In 35th Conference on Neural Information Processing Systems. Virtual. https://doi.org/10.48550/arXiv.2111.03165
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10694 |
Avni, G., Jecker, I. R., & Zikelic, D. (2021). Infinite-duration all-pay bidding games. In D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (pp. 617–636). Virtual: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.38
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10847 |
Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575
[Published Version]
View
| DOI
| Download Published Version (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 9987 |
Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., & Toman, V. (2021). Stateless model checking under a reads-value-from equivalence. In 33rd International Conference on Computer-Aided Verification (Vol. 12759, pp. 341–366). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-81685-8_16
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Published | Thesis | IST-REx-ID: 10199 |
Toman, V. (2021). Improved verification techniques for concurrent systems. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:10199
[Published Version]
View
| Files available
| DOI
2021 | Published | Journal Article | IST-REx-ID: 10191 |
Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A., & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3485541
[Published Version]
View
| Files available
| DOI
| arXiv
2020 | Published | Conference Paper | IST-REx-ID: 8193
Chatterjee, K., Chmelik, M., Karkhanis, D., Novotný, P., & Royer, A. (2020). Multiple-environment Markov decision processes: Efficient analysis and applications. In Proceedings of the 30th International Conference on Automated Planning and Scheduling (Vol. 30, pp. 48–56). Nancy, France: Association for the Advancement of Artificial Intelligence.
View
| Files available
2020 | Published | Conference Paper | IST-REx-ID: 8324 |
Wang, P., Fu, H., Chatterjee, K., Deng, Y., & Xu, M. (2020). Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. In Proceedings of the ACM on Programming Languages (Vol. 4). ACM. https://doi.org/10.1145/3371093
[Published Version]
View
| Files available
| DOI
| arXiv