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.

527 Publications


2021 | Research Data Reference | IST-REx-ID: 15284 | OA
RevTerm
K. Chatterjee, E.K. Goharshady, P. Novotný, D. Zikelic, (2021).
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 | Published | Conference Paper | IST-REx-ID: 10002 | OA
Symbolic time and space tradeoffs for probabilistic verification
K. Chatterjee, W. Dvorak, M. 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
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10004 | OA
Stochastic processes with expected stopping time
K. Chatterjee, L. Doyen, 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 | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10054 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10075 | OA
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
 

2021 | Published | Journal Article | IST-REx-ID: 10191 | OA
The reads-from equivalence for the TSO and PSO memory models
T.L. Bui, K. Chatterjee, T. Gautam, A. Pavlogiannis, V. Toman, Proceedings of the ACM on Programming Languages 5 (2021).
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Thesis | PhD | IST-REx-ID: 10199 | OA
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
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
On lexicographic proof rules for probabilistic termination
K. Chatterjee, E. Goharshady, P. Novotný, J. Zárevúcky, D. Zikelic, in:, 24th International Symposium on Formal Methods, Springer Nature, 2021, pp. 619–639.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10667 | OA
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
 

2021 | Published | Conference Paper | IST-REx-ID: 10694 | OA
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
 

2021 | Published | Journal Article | IST-REx-ID: 8793 | OA
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
 

2021 | Published | Journal Article | IST-REx-ID: 9293 | OA
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
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 9296 | OA
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.) | WoS | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 9381 | OA
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 | PubMed | Europe PMC
 

2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
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
 

2021 | Book Chapter | IST-REx-ID: 9403 | OA
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.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed