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
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. RevTerm. 2021. doi:10.1145/3410304
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2021 | Published | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee K, Dvorak W, Henzinger M, 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
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10004 | OA
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 | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10052 | OA
Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10054 | OA
Chatterjee K, Henzinger M, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124
[Published Version] View | Files available | DOI
 

2021 | Published | Conference Paper | IST-REx-ID: 10055 | OA
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 | Published | Conference Paper | IST-REx-ID: 10075 | OA
Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53
[Published Version] View | Files available | DOI | arXiv
 

2021 | Published | Journal Article | IST-REx-ID: 10191 | OA
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 | Published | Thesis | PhD | IST-REx-ID: 10199 | OA
Toman V. Improved verification techniques for concurrent systems. 2021. doi:10.15479/at:ista:10199
[Published Version] View | Files available | DOI
 

earlier version | 2021 | Published | Conference Paper | IST-REx-ID: 10414 | OA
Chatterjee K, Goharshady E, Novotný P, Zárevúcky J, Zikelic D. On lexicographic proof rules for probabilistic termination. In: 24th International Symposium on Formal Methods. Vol 13047. Springer Nature; 2021:619-639. doi:10.1007/978-3-030-90870-6_33
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
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 | Published | Conference Paper | IST-REx-ID: 10630 | OA
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 | Published | Conference Paper | IST-REx-ID: 10667 | OA
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 | Published | Conference Paper | IST-REx-ID: 10694 | OA
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 | Published | Journal Article | IST-REx-ID: 8793 | OA
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 | Published | Journal Article | IST-REx-ID: 9293 | OA
Chatterjee K, Dvořák W, Henzinger M, 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
 

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

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

2021 | Published | Journal Article | IST-REx-ID: 9393 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. 2021;57:401-428. doi:10.1007/s10703-021-00373-5
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

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

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed