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.
454 Publications
2022 | Submitted | Preprint | IST-REx-ID: 12677 | 
Chatterjee, K., Mohammadi, M., & Saona Urmeneta, R. J. (n.d.). Repeated prophet inequality with near-optimal bounds. arXiv. https://doi.org/10.48550/ARXIV.2209.14368
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12102 |
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 12101 |
Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11
[Published Version]
View
| Files available
| DOI
2022 | Published | Conference Paper | IST-REx-ID: 12000 |
Chatterjee, K., Goharshady, A. K., Meggendorfer, T., & Zikelic, D. (2022). Sound and complete certificates for auantitative termination analysis of probabilistic programs. In Proceedings of the 34th International Conference on Computer Aided Verification (Vol. 13371, pp. 55–78). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-031-13185-1_4
[Published Version]
View
| Files available
| DOI
| WoS
2022 | Published | Journal Article | IST-REx-ID: 12511 |
Lechner, M., Zikelic, D., Chatterjee, K., & Henzinger, T. A. (2022). Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v36i7.20695
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Submitted | Preprint | IST-REx-ID: 14601 |
Zikelic, D., Lechner, M., Chatterjee, K., & Henzinger, T. A. (n.d.). Learning stabilizing policies in stochastic control systems. arXiv. https://doi.org/10.48550/arXiv.2205.11991
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Submitted | Preprint | IST-REx-ID: 14600 |
Zikelic, D., Lechner, M., Henzinger, T. A., & Chatterjee, K. (n.d.). Learning control policies for stochastic systems with reach-avoid guarantees. arXiv. https://doi.org/10.48550/ARXIV.2210.05308
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2022 | Published | Journal Article | IST-REx-ID: 10731 |
Svoboda, J., Tkadlec, J., Pavlogiannis, A., Chatterjee, K., & Nowak, M. A. (2022). Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-022-05333-5
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 8793 |
Zeiner, M., Schmid, U., & Chatterjee, K. (2021). Optimal strategies for selecting coordinators. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2020.10.022
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Published | Journal Article | IST-REx-ID: 9293 |
Chatterjee, K., Dvořák, W., Henzinger, M. H., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence. Elsevier. https://doi.org/10.1016/j.artint.2021.103499
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 9296 |
Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2021 | Published | Journal Article | IST-REx-ID: 9393 |
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design. Springer. https://doi.org/10.1007/s10703-021-00373-5
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2021 | Book Chapter | IST-REx-ID: 9403 |
Schmid, L., & Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig & C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.
[Published Version]
View
| Download Published Version (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10052 |
Jecker, I. R., Mazzocchi, N., & Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2021.18
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10055 |
Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.44
[Published Version]
View
| Files available
| DOI
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10075 |
Guha, S., Jecker, I. R., Lehtinen, K., & Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.53
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Conference Paper | IST-REx-ID: 10629 |
Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10630 |
Arrighi, E., Fernau, H., Hoffmann, S., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., & Wolf, P. (2021). 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). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34
[Published Version]
View
| Files available
| DOI
| arXiv
2021 | Published | Thesis | IST-REx-ID: 8934 |
Goharshady, A. K. (2021). Parameterized and algebro-geometric advances in static program analysis. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:8934
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 12767 |
Bansal, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. https://doi.org/10.1007/978-3-030-72016-2
[Published Version]
View
| Files available
| DOI
| arXiv