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.




520 Publications

2022 | Draft | Preprint | IST-REx-ID: 14601 | OA
Zikelic D, Lechner M, Chatterjee K, Henzinger TA. Learning stabilizing policies in stochastic control systems. arXiv, 2205.11991.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 12280 | OA
Schmid L, Hilbe C, Chatterjee K, Nowak M. 2022. Direct reciprocity between individuals that use different strategy spaces. PLOS Computational Biology. 18(6), e1010149.
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2022 | Published | Journal Article | IST-REx-ID: 12511 | OA
Lechner M, Zikelic D, Chatterjee K, Henzinger TA. 2022. Stability verification in stochastic control systems via neural network supermartingales. Proceedings of the AAAI Conference on Artificial Intelligence. 36(7), 7326–7336.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 12568 | OA
Meggendorfer T. 2022. Risk-aware stochastic shortest path. Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022. Conference on Artificial Intelligence vol. 36, 9858–9867.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Submitted | Preprint | IST-REx-ID: 12677 | OA
Chatterjee K, Mohammadi M, Saona Urmeneta RJ. Repeated prophet inequality with near-optimal bounds. arXiv, 2209.14368.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Published | Conference Paper | IST-REx-ID: 12775 | OA
Grover K, Kretinsky J, Meggendorfer T, Weininger M. 2022. Anytime guarantees for reachability in uncountable Markov decision processes. 33rd International Conference on Concurrency Theory . CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 243, 11.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 10602 | OA
Kretinsky J, Meggendorfer T, Waldmann C, Weininger M. 2022. Index appearance record with preorders. Acta Informatica. 59, 585–618.
[Published Version] View | Files available | DOI | WoS
 
2022 | Published | Journal Article | IST-REx-ID: 10731 | OA
Svoboda J, Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2022. Infection dynamics of COVID-19 virus under lockdown and reopening. Scientific Reports. 12(1), 1526.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 11402 | OA
Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 17061 | OA
McAvoy A, Kates-Harbeck J, Chatterjee K, Hilbe C. 2022. Evolutionary instability of selfish learning in repeated games. PNAS Nexus. 1(4), pgac141.
[Published Version] View | Files available | DOI | PubMed | Europe PMC | arXiv
 
2022 | Published | Journal Article | IST-REx-ID: 9311 | OA
Chatterjee K, Saona Urmeneta RJ, Ziliotto B. 2022. Finite-memory strategies in POMDPs with long-run average objectives. Mathematics of Operations Research. 47(1), 100–119.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 12767 | OA
Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Research Data Reference | IST-REx-ID: 15284 | OA
Chatterjee K, Goharshady EK, Novotný P, Zikelic D. 2021. RevTerm, Association for Computing Machinery, 10.1145/3410304.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2021 | Published | Conference Paper | IST-REx-ID: 10629 | OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2021. Quantitative verification on product graphs of small treewidth. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 42.
[Published Version] View | Files available | DOI
 
2021 | Published | Conference Paper | IST-REx-ID: 10630 | OA
Arrighi E, Fernau H, Hoffmann S, Holzer M, Jecker IR, De Oliveira Oliveira M, Wolf P. 2021. On the complexity of intersection non-emptiness for star-free language classes. 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 213, 34.
[Published Version] View | Files available | DOI | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10667 | OA
Lechner M, Žikelić Ð, Chatterjee K, Henzinger TA. 2021. Infinite time horizon safety of Bayesian neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, .
[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. 2021. Infinite-duration all-pay bidding games. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 617–636.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10847 | OA
Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence, 4182–4189.
[Published Version] View | DOI | Download Published Version (ext.)
 
2021 | Published | Conference Paper | IST-REx-ID: 10002 | OA
Chatterjee K, Dvorak W, Henzinger M, Svozil A. 2021. Symbolic time and space tradeoffs for probabilistic verification. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2021 | Published | Conference Paper | IST-REx-ID: 10004 | OA
Chatterjee K, Doyen L. 2021. Stochastic processes with expected stopping time. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 1–13.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed