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
Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.” Journal of the ACM. ACM, 2017. https://doi.org/10.1145/3121408.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 717 | OA
Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” Journal of Computer and System Sciences. Academic Press, 2017. https://doi.org/10.1016/j.jcss.2017.04.005.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2017 | Published | Journal Article | IST-REx-ID: 719
Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.” Acta Informatica. Springer, 2017. https://doi.org/10.1007/s00236-017-0299-0.
View | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 744 | OA
Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.” Journal of Theoretical Biology. Elsevier, 2017. https://doi.org/10.1016/j.jtbi.2017.08.025.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2017 | Published | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:26)2017.
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 466 | OA
Chatterjee, Krishnendu, Zuzana Křetínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” Logical Methods in Computer Science. International Federation of Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(2:15)2017.
[Published Version] View | Files available | DOI
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.” ACM Transactions on Computational Logic (TOCL). ACM, 2017. https://doi.org/10.1145/3152769.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 512 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.” Scientific Reports. Nature Publishing Group, 2017. https://doi.org/10.1038/s41598-017-00107-w.
[Published Version] View | Files available | DOI
 
2017 | Published | Technical Report | IST-REx-ID: 5455 | OA
Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-870-v1-1.
[Published Version] View | Files available | DOI
 
2017 | Published | Technical Report | IST-REx-ID: 5456 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017. https://doi.org/10.15479/AT:IST-2017-872-v1-1.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 551 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.61.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 552 | OA
Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.39.
[Published Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 553 | OA
Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.” In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. https://doi.org/10.4230/LIPIcs.MFCS.2017.55.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2017 | Research Data | IST-REx-ID: 5559 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:51.
[Published Version] View | Files available | DOI
 
2017 | Published | Book Chapter | IST-REx-ID: 625 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.” In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017. https://doi.org/10.1007/978-3-319-63121-9_18.
[Submitted Version] View | Files available | DOI
 
2017 | Published | Conference Paper | IST-REx-ID: 628 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.” edited by Rupak Majumdar and Viktor Kunčak, 10426:118–39. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_6.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.” edited by Rupak Majumdar and Viktor Kunčak, 10427:41–63. Springer, 2017. https://doi.org/10.1007/978-3-319-63390-9_3.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 645 | OA
Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.” edited by Rupak Majumdar and Viktor Kunčak, 10426:201–21. Springer, 2017. https://doi.org/10.1007/978-3-319-63387-9_10.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Published | Conference Paper | IST-REx-ID: 6519 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,” Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017. https://doi.org/10.4230/LIPICS.CSL.2017.18.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed