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.

Krishnendu Chatterjee

Ali Asadi

Ehsan Kafshdar Goharshadi

Mehrdad Karrabi

Pavol Kebis

Ruichen Luo

David Lurie

Satya Nayak

Ali Shafiee

Martin Chmelik

Ventsislav Chonev

Benjamin Aminof

Hongfei Fu

Amir Goharshady

Christian Hilbe

Florian Horn

Mingzhang Huang

Valentin Hübner

Rasmus Ibsen-Jensen

Ismael Jecker

Joost Katoen

Maria Kleshnina

Jan Kretinsky

John Lazarsfeld

Tobias Meggendorfer

Petr Novotny

Andreas Pavlogiannis

Tadeas Priklopil

Johannes Reiter

Sasha Rubin

Raimundo Saona Urmeneta

Laura Schmid

Jakub Svoboda

Pepa Tkadlec

Viktor Toman

Mathieu Tracol

Maximilian Weininger

Djordje Zikelic



534 Publications

2015 | Published | Conference Paper | IST-REx-ID: 1882 | OA
Compositionality for quantitative specifications
U. Fahrenberg, J. Kretinsky, A. Legay, L. Traonouez, in:, Springer, 2015, pp. 306–324.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2015 | Published | Journal Article | IST-REx-ID: 523 | OA
Looking at mean-payoff and total-payoff through windows
K. Chatterjee, L. Doyen, M. Randour, J. Raskin, Information and Computation 242 (2015) 25–52.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2015 | Published | Journal Article | IST-REx-ID: 524 | OA
Qualitative analysis of concurrent mean payoff games
K. Chatterjee, R. Ibsen-Jensen, Information and Computation 242 (2015) 2–24.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5430 | OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
2015 | Published | Technical Report | IST-REx-ID: 5431 | OA
The patience of concurrent stochastic games with safety and reachability objectives
K. Chatterjee, R. Ibsen-Jensen, K. Hansen, The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5432 | OA
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5437 | OA
Faster algorithms for quantitative verification in constant treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
2015 | Published | Technical Report | IST-REx-ID: 5440 | OA
The complexity of evolutionary games on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary Games on Graphs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5441 | OA
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5443 | OA
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
2015 | Published | Technical Report | IST-REx-ID: 5444 | OA
Reconstructing robust phylogenies of metastatic cancers
J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue, B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers, IST Austria, 2015.
[Published Version] View | Files available | DOI
 
2015 | Research Data | IST-REx-ID: 5549 | OA
Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
A. Fellner, (2015).
[Published Version] View | Files available | DOI
 
2015 | Published | Conference Paper | IST-REx-ID: 10796 | OA
The value 1 problem under finite-memory strategies for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2015 | Published | Journal Article | IST-REx-ID: 1731 | OA
Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, Information and Computation 245 (2015) 3–16.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2015 | Published | Conference Paper | IST-REx-ID: 1732 | OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2015 | Published | Conference Paper | IST-REx-ID: 1838 | OA
Assume-guarantee synthesis for concurrent reactive programs with partial information
R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp. 517–532.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2015 | Published | Conference Paper | IST-REx-ID: 1839 | OA
Multigain: A controller synthesis tool for MDPs with multiple mean-payoff objectives
T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
earlier version | 2015 | Published | Conference Paper | IST-REx-ID: 1610 | OA
Edit distance for pushdown automata
K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp. 121–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
earlier version | 2015 | Published | Conference Paper | IST-REx-ID: 1657 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
earlier version | 2015 | Published | Technical Report | IST-REx-ID: 5435 | OA
Unifying two views on multiple mean-payoff objectives in Markov decision processes
K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed