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.
489 Publications
2021 | Published | Journal Article | IST-REx-ID: 9293 | 
Algorithms and conditional lower bounds for planning problems
K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, W. Dvořák, M. Henzinger, A. Svozil, Artificial Intelligence 297 (2021).
2021 | Published | Journal Article | IST-REx-ID: 9640 |
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 | Journal Article | IST-REx-ID: 9393 |
Faster algorithms for quantitative verification in bounded treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Formal Methods in System Design 57 (2021) 401–428.
2021 | Published | Conference Paper | IST-REx-ID: 10052 |
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: 10630 |
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: 10075 |
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: 10054 |
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M. 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. 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: 10055 |
A Ramsey theorem for finite monoids
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
I.R. Jecker, in:, 38th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
2021 | Published | Thesis | IST-REx-ID: 10199 |
Improved verification techniques for concurrent systems
V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
V. Toman, Improved Verification Techniques for Concurrent Systems, Institute of Science and Technology Austria, 2021.
2021 | Published | Thesis | IST-REx-ID: 10293 |
Evolution of cooperation via (in)direct reciprocity under imperfect information
L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
L. Schmid, Evolution of Cooperation via (in)Direct Reciprocity under Imperfect Information, Institute of Science and Technology Austria, 2021.
2021 | Published | Journal Article | IST-REx-ID: 9997 |
The evolution of indirect reciprocity under action and assessment generosity
L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
L. Schmid, P. Shati, C. Hilbe, K. Chatterjee, Scientific Reports 11 (2021).
2021 | Published | Journal Article | IST-REx-ID: 9402 |
A unified framework of direct and indirect reciprocity
L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.
[Submitted Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
L. Schmid, K. Chatterjee, C. Hilbe, M.A. Nowak, Nature Human Behaviour 5 (2021) 1292–1302.
2021 | Published | Thesis | IST-REx-ID: 8934 |
Parameterized and algebro-geometric advances in static program analysis
A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
A.K. Goharshady, Parameterized and Algebro-Geometric Advances in Static Program Analysis, Institute of Science and Technology Austria, 2021.
2020 | Published | Conference Paper | IST-REx-ID: 15082 |
Disjoint tree-compatible plane perfect matchings
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.
[Published Version]
View
| Download Published Version (ext.)
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.
2020 | Published | Journal Article | IST-REx-ID: 8767 |
The Moran process on 2-chromatic graphs
K. Kaveh, A. McAvoy, K. Chatterjee, M.A. Nowak, PLOS Computational Biology 16 (2020).
[Published Version]
View
| Files available
| DOI
| WoS
K. Kaveh, A. McAvoy, K. Chatterjee, M.A. Nowak, PLOS Computational Biology 16 (2020).
2020 | Published | Conference Paper | IST-REx-ID: 8272 |
Stochastic games with lexicographic reachability-safety objectives
K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
K. Chatterjee, J.P. Katoen, M. Weininger, T. Winkler, in:, International Conference on Computer Aided Verification, Springer Nature, 2020, pp. 398–420.
2020 | Published | Conference Paper | IST-REx-ID: 7955 |
Approximating values of generalized-reachability stochastic games
Ashok, Pranav, Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . 2020
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
Ashok, Pranav, Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . 2020
2020 | Published | Journal Article | IST-REx-ID: 15055 |
Reinforcement learning of risk-constrained policies in Markov decision processes
T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.
2020 | Published | Conference Paper | IST-REx-ID: 8324 |
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.
[Published Version]
View
| Files available
| DOI
| arXiv
P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.
2020 | Published | Conference Paper | IST-REx-ID: 8193
Multiple-environment Markov decision processes: Efficient analysis and applications
Chatterjee, Krishnendu, Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling 30. 2020
View
| Files available
Chatterjee, Krishnendu, Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling 30. 2020