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.
468 Publications
2022 |Submitted| Preprint | IST-REx-ID: 14601 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Learning stabilizing policies in stochastic control systems
D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).
2022 |Submitted| Preprint | IST-REx-ID: 14600 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Learning control policies for stochastic systems with reach-avoid guarantees
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).
2022 |Published| Journal Article | IST-REx-ID: 17061 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Evolutionary instability of selfish learning in repeated games
A. McAvoy, J. Kates-Harbeck, K. Chatterjee, C. Hilbe, PNAS Nexus 1 (2022).
[Published Version]
View
| Files available
| DOI
| arXiv
A. McAvoy, J. Kates-Harbeck, K. Chatterjee, C. Hilbe, PNAS Nexus 1 (2022).
2021 |Published| Conference Paper | IST-REx-ID: 10052 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Decomposing permutation automata
I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
I.R. Jecker, N. Mazzocchi, P. Wolf, in:, 32nd International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
2021 |Published| Conference Paper | IST-REx-ID: 10054 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, M.H. Henzinger, S.S. Kale, A. Svozil, in:, 48th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
2021 |Published| Conference Paper | IST-REx-ID: 10075 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
A bit of nondeterminism makes pushdown automata expressive and succinct
S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
S. Guha, I.R. Jecker, K. Lehtinen, M. Zimmermann, in:, 46th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
2021 |Published| Conference Paper | IST-REx-ID: 10630 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On the complexity of intersection non-emptiness for star-free language classes
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| arXiv
E. Arrighi, H. Fernau, S. Hoffmann, M. Holzer, I.R. Jecker, M. De Oliveira Oliveira, P. Wolf, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.
2021 |Published| Conference Paper | IST-REx-ID: 10629 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Quantitative verification on product graphs of small treewidth
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 |Published| Conference Paper | IST-REx-ID: 10694 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Infinite-duration all-pay bidding games
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
G. Avni, I.R. Jecker, D. Zikelic, in:, D. Marx (Ed.), Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 617–636.
2021 |Published| Conference Paper | IST-REx-ID: 10847 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Solving partially observable stochastic shortest-path games
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.
[Published Version]
View
| DOI
| Download Published Version (ext.)
P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.
2021 |Published| Conference Paper | IST-REx-ID: 9296 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.
2021 | Book Chapter | IST-REx-ID: 9403 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
The evolution of strategic ignorance in strategic interaction
L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.
[Published Version]
View
| Download Published Version (ext.)
L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.
2021 |Published| Conference Paper | IST-REx-ID: 12767 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
On satisficing in quantitative games
S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.
[Published Version]
View
| Files available
| DOI
| arXiv
S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.
2021 |Published| Conference Paper | IST-REx-ID: 10667 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Infinite time horizon safety of Bayesian neural networks
M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
M. Lechner, Ð. Žikelić, K. Chatterjee, T.A. Henzinger, in:, 35th Conference on Neural Information Processing Systems, 2021.
2021 |Published| Journal Article | IST-REx-ID: 8793 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Optimal strategies for selecting coordinators
M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.
[Published Version]
View
| Files available
| DOI
| WoS
M. Zeiner, U. Schmid, K. Chatterjee, Discrete Applied Mathematics 289 (2021) 392–415.
2021 |Published| Journal Article | IST-REx-ID: 9381 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mistakes can stabilise the dynamics of rock-paper-scissors games
M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021).
[Published Version]
View
| Files available
| DOI
| WoS
M. Kleshnina, S.S. Streipert, J.A. Filar, K. Chatterjee, PLoS Computational Biology 17 (2021).
2021 |Published| Journal Article | IST-REx-ID: 9640 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Fast and strong amplifiers of natural selection
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Nature Communications 12 (2021).
2021 |Published| Conference Paper | IST-REx-ID: 9646 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Quantitative analysis of assertion violations in probabilistic programs
J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
J. Wang, Y. Sun, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 1171–1186.
2021 |Published| Conference Paper | IST-REx-ID: 9645 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Polynomial reachability witnesses via Stellensätze
A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
A. Asadi, K. Chatterjee, H. Fu, A.K. Goharshady, M. Mahdavi, in:, Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2021, pp. 772–787.
2021 |Published| Conference Paper | IST-REx-ID: 10002 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Symbolic time and space tradeoffs for probabilistic verification
K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, W. Dvorak, M.H. Henzinger, A. Svozil, in:, Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Institute of Electrical and Electronics Engineers, 2021, pp. 1–13.