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.




459 Publications

2022 | Conference Paper | IST-REx-ID: 12101 | OA
Complexity of spatial games
K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version] View | Files available | DOI
 
2022 | Conference Paper | IST-REx-ID: 12568 | OA
Risk-aware stochastic shortest path
T. Meggendorfer, in:, Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022, Association for the Advancement of Artificial Intelligence, 2022, pp. 9858–9867.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 11938 | OA
On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Preprint | IST-REx-ID: 12677 | OA
Repeated prophet inequality with near-optimal bounds
K. Chatterjee, M. Mohammadi, R.J. Saona Urmeneta, ArXiv (n.d.).
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2022 | Journal Article | IST-REx-ID: 10602 | OA
Index appearance record with preorders
J. Kretinsky, T. Meggendorfer, C. Waldmann, M. Weininger, Acta Informatica 59 (2022) 585–618.
[Published Version] View | Files available | DOI | WoS
 
2022 | Journal Article | IST-REx-ID: 10731 | OA
Infection dynamics of COVID-19 virus under lockdown and reopening
J. Svoboda, J. Tkadlec, A. Pavlogiannis, K. Chatterjee, M.A. Nowak, Scientific Reports 12 (2022).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Conference Paper | IST-REx-ID: 11459 | OA
Differential cost analysis with simultaneous potentials and anti-potentials
D. Zikelic, B.-Y.E. Chang, P. Bolignano, F. Raimondi, in:, Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2022, pp. 442–457.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 12257 | OA
Social balance on networks: Local minima and best-edge dynamics
K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022).
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Journal Article | IST-REx-ID: 12280 | OA
Direct reciprocity between individuals that use different strategy spaces
L. Schmid, C. Hilbe, K. Chatterjee, M. Nowak, PLOS Computational Biology 18 (2022).
[Published Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2022 | Journal Article | IST-REx-ID: 9311 | OA
Finite-memory strategies in POMDPs with long-run average objectives
K. Chatterjee, R.J. Saona Urmeneta, B. Ziliotto, Mathematics of Operations Research 47 (2022) 100–119.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Conference Paper | IST-REx-ID: 12170
PET – A partial exploration tool for probabilistic verification
T. Meggendorfer, in:, 20th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2022, pp. 320–326.
View | DOI
 
2022 | Journal Article | IST-REx-ID: 11402 | OA
Graph planning with expected finite horizon
K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2022 | Conference Paper | IST-REx-ID: 12775 | OA
Anytime guarantees for reachability in uncountable Markov decision processes
K. Grover, J. Kretinsky, T. Meggendorfer, M. Weininger, in:, 33rd International Conference on Concurrency Theory , Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[Published Version] View | Files available | DOI | arXiv
 
2022 | Conference Paper | IST-REx-ID: 12000 | OA
Sound and complete certificates for auantitative termination analysis of probabilistic programs
K. Chatterjee, A.K. Goharshady, T. Meggendorfer, D. Zikelic, in:, Proceedings of the 34th International Conference on Computer Aided Verification, Springer, 2022, pp. 55–78.
[Published Version] View | Files available | DOI | WoS
 
2022 | Journal Article | IST-REx-ID: 12511 | OA
Stability verification in stochastic control systems via neural network supermartingales
M. Lechner, D. Zikelic, K. Chatterjee, T.A. Henzinger, Proceedings of the AAAI Conference on Artificial Intelligence 36 (2022) 7326–7336.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Preprint | IST-REx-ID: 14601 | OA
Learning stabilizing policies in stochastic control systems
D. Zikelic, M. Lechner, K. Chatterjee, T.A. Henzinger, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2022 | Preprint | IST-REx-ID: 14600 | OA
Learning control policies for stochastic systems with reach-avoid guarantees
D. Zikelic, M. Lechner, T.A. Henzinger, K. Chatterjee, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2021 | 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 | Conference Paper | IST-REx-ID: 10054 | OA
Faster algorithms for bounded liveness in graphs and game graphs
K. Chatterjee, M.H. 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 | 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
 

Search

Filter Publications