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.

Jakub Svoboda

Maximilian Weininger

Ali Asadi

Ehsan Kafshdar Goharshadi

Krishnendu Chatterjee

Valentin Hübner

Mehrdad Karrabi

Raimundo Saona Urmeneta

Ruichen Luo

Djordje Zikelic

Pepa Tkadlec

Mathieu Tracol

Amir Goharshady

Hongfei Fu

Viktor Toman

Rasmus Ibsen-Jensen

Martin Chmelik

Ventsislav Chonev

Florian Horn

Laura Schmid

Tadeas Priklopil

Petr Novotny

Jan Kretinsky

Joost Katoen

Sasha Rubin

Christian Hilbe

Andreas Pavlogiannis

Benjamin Aminof

Johannes Reiter

Maria Kleshnina

John Lazarsfeld

Ismael Jecker

Mingzhang Huang

Tobias Meggendorfer



454 Publications

2018 | Published | Conference Paper | IST-REx-ID: 10883 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.
[Published Version] View | Files available | DOI | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 24 | OA
K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 25 | OA
K. Horák, B. Bošanský, and K. Chatterjee, “Goal-HSVI: Heuristic search value iteration for goal-POMDPs,” in Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018–July, pp. 4764–4770.
[Published Version] View | DOI | Download Published Version (ext.) | WoS
 
2018 | Published | Journal Article | IST-REx-ID: 293 | OA
M. Hoffman, C. Hilbe, and M. Nowak, “The signal-burying game can explain why we obscure positive traits and good deeds,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 397–404, 2018.
[Submitted Version] View | Files available | DOI | WoS
 
2018 | Published | Conference Paper | IST-REx-ID: 297 | OA
T. Brázdil, K. Chatterjee, J. Kretinsky, and V. Toman, “Strategy representation by decision trees in reactive synthesis,” presented at the TACAS 2018: Tools and Algorithms for the Construction and Analysis of Systems, Thessaloniki, Greece, 2018, vol. 10805, pp. 385–407.
[Published Version] View | Files available | DOI | WoS
 
2018 | Published | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 311 | OA
K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.
[Published Version] View | Files available | DOI
 
2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
S. Agrawal, K. Chatterjee, and P. Novotný, “Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs,” presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA, 2018, vol. 2, no. POPL.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 34 | OA
K. Chatterjee, M. Chemlík, and U. Topcu, “Sensor synthesis for POMDPs with reachability objectives,” presented at the ICAPS: International Conference on Automated Planning and Scheduling, Delft, Netherlands, 2018, vol. 2018, pp. 47–55.
[Preprint] View | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 35 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Files available | Download None (ext.) | WoS | arXiv
 
2018 | Published | Journal Article | IST-REx-ID: 419 | OA
C. Hilbe, K. Chatterjee, and M. Nowak, “Partners and rivals in direct reciprocity,” Nature Human Behaviour, vol. 2. Nature Publishing Group, pp. 469–477, 2018.
[Submitted Version] View | Files available | DOI | WoS
 
2018 | Published | Journal Article | IST-REx-ID: 454 | OA
J. Reiter, C. Hilbe, D. Rand, K. Chatterjee, and M. Nowak, “Crosstalk in concurrent repeated games impedes direct reciprocity and requires stronger levels of forgiveness,” Nature Communications, vol. 9, no. 1. Nature Publishing Group, 2018.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1294 | OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” Journal of Computer and System Sciences, vol. 84. Elsevier, pp. 144–170, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 13160 | OA
J. Kretinsky, T. Meggendorfer, C. Waldmann, and M. Weininger, “Index appearance record for transforming Rabin automata into parity automata,” in Tools and Algorithms for the Construction and Analysis of Systems, Uppsala, Sweden, 2017, vol. 10205, pp. 443–460.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Thesis | PhD | IST-REx-ID: 821 | OA
A. Pavlogiannis, “Algorithmic advances in program analysis and their applications,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 699 | OA
C. Veller, L. Hayward, M. Nowak, and C. Hilbe, “The red queen and king in finite populations,” PNAS, vol. 114, no. 27. National Academy of Sciences, pp. E5396–E5405, 2017.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | PubMed | Europe PMC
 
2017 | Published | Conference Paper | IST-REx-ID: 711 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Bidirectional nested weighted automata,” presented at the 28th International Conference on Concurrency Theory, CONCUR, Berlin, Germany, 2017, vol. 85.
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 716 | OA
K. Chatterjee and Y. Velner, “The complexity of mean-payoff pushdown games,” Journal of the ACM, vol. 64, no. 5. ACM, p. 34, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 717 | OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” Journal of Computer and System Sciences, vol. 88. Academic Press, pp. 236–259, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2017 | Published | Journal Article | IST-REx-ID: 719
K. Chatterjee and R. Ehlers, “Special issue: Synthesis and SYNT 2014,” Acta Informatica, vol. 54, no. 6. Springer, pp. 543–544, 2017.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed