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.

Maximilian Weininger

Ali Asadi

Ehsan Kafshdar Goharshadi

Jakub Svoboda

Krishnendu Chatterjee

Valentin Hübner

Mehrdad Karrabi

Raimundo Saona Urmeneta

Ruichen Luo

Amir Goharshady

Hongfei Fu

Viktor Toman

Rasmus Ibsen-Jensen

Djordje Zikelic

Pepa Tkadlec

Mathieu Tracol

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

2017 | Published | Journal Article | IST-REx-ID: 716 | OA
The complexity of mean-payoff pushdown games
K. Chatterjee, Y. Velner, Journal of the ACM 64 (2017) 34.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 717 | OA
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2017 | Published | Journal Article | IST-REx-ID: 719
Special issue: Synthesis and SYNT 2014
K. Chatterjee, R. Ehlers, Acta Informatica 54 (2017) 543–544.
View | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 744 | OA
Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
T. Priklopil, K. Chatterjee, M. Nowak, Journal of Theoretical Biology 433 (2017) 64–72.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2017 | Published | Journal Article | IST-REx-ID: 464 | OA
Improved algorithms for parity and Streett objectives
K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 466 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Křetínská, J. Kretinsky, Logical Methods in Computer Science 13 (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational Logic (TOCL) 18 (2017).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
Amplification on undirected population structures: Comets beat stars
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Scientific Reports 7 (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
Optimal Dyck reachability for data-dependence and alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Optimal Dyck Reachability for Data-Dependence and Alias Analysis, IST Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Data-Centric Dynamic Partial Order Reduction, IST Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
Faster Monte Carlo algorithms for fixation probability of the Moran process on undirected graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 552 | OA
Faster algorithms for mean-payoff parity games
K. Chatterjee, M.H. Henzinger, A. Svozil, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
Strategy complexity of concurrent safety games
K. Chatterjee, K. Hansen, R. Ibsen-Jensen, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2017 | Research Data | IST-REx-ID: 5559 | OA
Strong amplifiers of natural selection
A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak , (2017).
[Published Version] View | Files available | DOI
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
The cost of exactness in quantitative reachability
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, L. Aceto, G. Bacci, A. Ingólfsdóttir, A. Legay, R. Mardare (Eds.), Models, Algorithms, Logics and Tools, Springer, 2017, pp. 367–381.
[Submitted Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 628 | OA
Automated recurrence analysis for almost linear expected runtime bounds
K. Chatterjee, H. Fu, A. Murhekar, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 118–139.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 645 | OA
Value iteration for long run average reward in markov decision processes
P. Ashok, K. Chatterjee, P. Daca, J. Kretinsky, T. Meggendorfer, in:, R. Majumdar, V. Kunčak (Eds.), Springer, 2017, pp. 201–221.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 6519 | OA
Improved set-based symbolic algorithms for parity games
K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed