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.

Valentin Hübner

Krishnendu Chatterjee

Raimundo Saona Urmeneta

Jakub Svoboda

Maximilian Weininger

Ehsan Kafshdar Goharshadi

Mehrdad Karrabi

Ali Asadi

Mingzhang Huang

Ismael Jecker

Mathieu Tracol

Sasha Rubin

Christian Hilbe

Jan Kretinsky

Djordje Zikelic

Amir Goharshady

Rasmus Ibsen-Jensen

Viktor Toman

Benjamin Aminof

Maria Kleshnina

Pepa Tkadlec

Florian Horn

Tobias Meggendorfer

Laura Schmid

Ventsislav Chonev

Johannes Reiter

Petr Novotny

Martin Chmelik

Tadeas Priklopil

Hongfei Fu

Andreas Pavlogiannis

Joost Katoen



459 Publications

2020 | Conference Paper | IST-REx-ID: 8324 | OA
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P. Wang, H. Fu, K. Chatterjee, Y. Deng, M. Xu, in:, Proceedings of the ACM on Programming Languages, ACM, 2020.
[Published Version] View | Files available | DOI | arXiv
 
2020 | Journal Article | IST-REx-ID: 15055 | OA
Reinforcement learning of risk-constrained policies in Markov decision processes
T. Brázdil, K. Chatterjee, P. Novotný, J. Vahala, Proceedings of the 34th AAAI Conference on Artificial Intelligence 34 (2020) 9794–9801.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2020 | Conference Paper | IST-REx-ID: 15082 | OA
Disjoint tree-compatible plane perfect matchings
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.
[Published Version] View | Download Published Version (ext.)
 
2020 | Conference Paper | IST-REx-ID: 7810 | OA
Optimal and perfectly parallel algorithms for on-demand data-flow analysis
K. Chatterjee, A.K. Goharshady, R. Ibsen-Jensen, A. Pavlogiannis, in:, European Symposium on Programming, Springer Nature, 2020, pp. 112–140.
[Published Version] View | Files available | DOI | WoS
 
2020 | Conference Paper | IST-REx-ID: 8728 | OA
Faster algorithms for quantitative analysis of MCs and MDPs with small treewidth
A. Asadi, K. Chatterjee, A.K. Goharshady, K. Mohammadi, A. Pavlogiannis, in:, Automated Technology for Verification and Analysis, Springer Nature, 2020, pp. 253–270.
[Submitted Version] View | Files available | DOI | WoS
 
2020 | Conference Paper | IST-REx-ID: 8089 | OA
Polynomial invariant generation for non-deterministic recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, E.K. Goharshady, in:, Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, Association for Computing Machinery, 2020, pp. 672–687.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2020 | Journal Article | IST-REx-ID: 6918 | OA
An efficient algorithm for computing network reliability in small treewidth
A.K. Goharshady, F. Mohammadi, Reliability Engineering and System Safety 193 (2020).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Conference Paper | IST-REx-ID: 6887 | OA
Near-linear time algorithms for Streett objectives in graphs and MDPs
K. Chatterjee, W. Dvorák, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6885 | OA
Long-run average behavior of vector addition systems with states
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6889 | OA
Combinations of Qualitative Winning for Stochastic Parity Games
K. Chatterjee, N. Piterman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version] View | Files available | DOI
 

Search

Filter Publications