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.
459 Publications
2021 | 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 | 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 | 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 | 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 | 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.)
| arXiv
2021 | Book Chapter | IST-REx-ID: 9403 |
Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. Deliberate Ignorance: Choosing Not To Know. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.
[Published Version]
View
| Download Published Version (ext.)
2021 | 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
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Conference Paper | IST-REx-ID: 10667 |
Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. Infinite time horizon safety of Bayesian neural networks. In: 35th Conference on Neural Information Processing Systems. ; 2021. doi:10.48550/arXiv.2111.03165
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2021 | 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
2021 | Journal Article | IST-REx-ID: 9381 |
Kleshnina M, Streipert SS, Filar JA, Chatterjee K. Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Computational Biology. 2021;17(4). doi:10.1371/journal.pcbi.1008523
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Journal Article | IST-REx-ID: 9640 |
Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. Fast and strong amplifiers of natural selection. Nature Communications. 2021;12(1). doi:10.1038/s41467-021-24271-w
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 | Conference Paper | IST-REx-ID: 9646 |
Wang J, Sun Y, Fu H, Chatterjee K, Goharshady AK. Quantitative analysis of assertion violations in probabilistic programs. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:1171-1186. doi:10.1145/3453483.3454102
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 9645 |
Asadi A, Chatterjee K, Fu H, Goharshady AK, Mahdavi M. Polynomial reachability witnesses via Stellensätze. In: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. Association for Computing Machinery; 2021:772-787. doi:10.1145/3453483.3454076
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 | Conference Paper | IST-REx-ID: 10002 |
Chatterjee K, Dvorak W, Henzinger MH, Svozil A. Symbolic time and space tradeoffs for probabilistic verification. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470739
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Conference Paper | IST-REx-ID: 10004 |
Chatterjee K, Doyen L. Stochastic processes with expected stopping time. In: Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. Institute of Electrical and Electronics Engineers; 2021:1-13. doi:10.1109/LICS52264.2021.9470595
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | 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 | Conference Paper | IST-REx-ID: 9987 |
Agarwal P, Chatterjee K, Pathak S, Pavlogiannis A, Toman V. Stateless model checking under a reads-value-from equivalence. In: 33rd International Conference on Computer-Aided Verification . Vol 12759. Springer Nature; 2021:341-366. doi:10.1007/978-3-030-81685-8_16
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | 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 | Thesis | 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
2021 | Journal Article | IST-REx-ID: 9293 |
Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. 2021;297(8). doi:10.1016/j.artint.2021.103499
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv