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

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.) | WoS | 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.) | WoS | 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.) | WoS | arXiv
 
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 | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 466 | OA
K. Chatterjee, Z. Křetínská, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes,” Logical Methods in Computer Science, vol. 13, no. 2. International Federation for Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 465 | OA
K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation for Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 464 | OA
K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation for Computational Logic, 2017.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 744 | OA
T. Priklopil, K. Chatterjee, and M. Nowak, “Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma,” Journal of Theoretical Biology, vol. 433. Elsevier, pp. 64–72, 2017.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 
2017 | Published | Journal Article | IST-REx-ID: 467 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM Transactions on Computational Logic, vol. 18, no. 4. ACM, 2017.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.
[Submitted Version] View | Files available | DOI | WoS
 
earlier version | 2017 | Published | Conference Paper | IST-REx-ID: 639 | OA
K. Chatterjee, H. Fu, and A. K. Goharshady, “Non-polynomial worst case analysis of recursive programs,” presented at the CAV: Computer Aided Verification, Heidelberg, Germany, 2017, vol. 10427, pp. 41–63.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1090 | OA
K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average automata of bounded width,” presented at the MFCS: Mathematical Foundations of Computer Science, Krakow; Poland, 2016, vol. 58.
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1093 | OA
P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City; Canada, 2016, vol. 59.
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1140 | OA
K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1166 | OA
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in POMDPs,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, United States, 2016, vol. 2016, pp. 3225–3232.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Published | Conference Paper | IST-REx-ID: 1182 | OA
K. Chatterjee, R. Ibsen-Jensen, and J. Tkadlec, “Robust draws in balanced knockout tournaments,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, New York, NY, USA, 2016, vol. 2016–January, pp. 172–179.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2016 | Published | Journal Article | IST-REx-ID: 1200 | OA
C. Hilbe and A. Traulsen, “Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on ‘Evolutionary game theory using agent-based methods’ by C. Adami, J. Schossau and A. Hintze,” Physics of Life Reviews, vol. 19. Elsevier, pp. 29–31, 2016.
[Submitted Version] View | Files available | DOI | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1245
V. Pandey and K. Chatterjee, “Game-theoretic models identify useful principles for peer collaboration in online learning platforms,” in Proceedings of the ACM Conference on Computer Supported Cooperative Work, San Francisco, CA, USA, 2016, vol. 26, no. Februar-2016, pp. 365–368.
View | DOI | WoS
 
2016 | Published | Journal Article | IST-REx-ID: 1322 | OA
C. Hilbe, K. Hagel, and M. Milinski, “Asymmetric power boosts extortion in an economic experiment,” PLoS One, vol. 11, no. 10. Public Library of Science, 2016.
[Published Version] View | Files available | DOI | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed