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.
463 Publications
2021 |Published| Conference Paper | IST-REx-ID: 10075 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Guha, I. R. Jecker, K. Lehtinen, and M. Zimmermann, “A bit of nondeterminism makes pushdown automata expressive and succinct,” in 46th International Symposium on Mathematical Foundations of Computer Science, Tallinn, Estonia, 2021, vol. 202.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10630 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10629 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
2021 |Published| Conference Paper | IST-REx-ID: 10694 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10847 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Book Chapter | IST-REx-ID: 9403 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Download Published Version (ext.)
2021 |Published| Conference Paper | IST-REx-ID: 12767 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10667 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Lechner, Ð. Žikelić, K. Chatterjee, and T. A. Henzinger, “Infinite time horizon safety of Bayesian neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, 2021.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 8793 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Zeiner, U. Schmid, and K. Chatterjee, “Optimal strategies for selecting coordinators,” Discrete Applied Mathematics, vol. 289, no. 1. Elsevier, pp. 392–415, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |Published| Journal Article | IST-REx-ID: 9381 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
M. Kleshnina, S. S. Streipert, J. A. Filar, and K. Chatterjee, “Mistakes can stabilise the dynamics of rock-paper-scissors games,” PLoS Computational Biology, vol. 17, no. 4. Public Library of Science, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |Published| Journal Article | IST-REx-ID: 9640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2021 |Published| Conference Paper | IST-REx-ID: 9646 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
J. Wang, Y. Sun, H. Fu, K. Chatterjee, and A. K. Goharshady, “Quantitative analysis of assertion violations in probabilistic programs,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 1171–1186.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 9645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A. Asadi, K. Chatterjee, H. Fu, A. K. Goharshady, and M. Mahdavi, “Polynomial reachability witnesses via Stellensätze,” in Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Online, 2021, pp. 772–787.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2021 |Published| Conference Paper | IST-REx-ID: 10002 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, W. Dvorak, M. H. 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10004 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 |Published| Conference Paper | IST-REx-ID: 10055 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
I. R. Jecker, “A Ramsey theorem for finite monoids,” in 38th International Symposium on Theoretical Aspects of Computer Science, Saarbrücken, Germany, 2021, vol. 187.
[Published Version]
View
| Files available
| DOI
| WoS
2021 |Published| Conference Paper | IST-REx-ID: 9987 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
P. Agarwal, K. Chatterjee, S. Pathak, A. Pavlogiannis, and V. Toman, “Stateless model checking under a reads-value-from equivalence,” in 33rd International Conference on Computer-Aided Verification , Virtual, 2021, vol. 12759, pp. 341–366.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 |Published| Journal Article | IST-REx-ID: 10191 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| arXiv
2021 |Published| Thesis | IST-REx-ID: 10199 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
V. Toman, “Improved verification techniques for concurrent systems,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI