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

2017 | Published | Journal Article | IST-REx-ID: 10417 | OA
Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., & Vaidya, K. (2017). Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158119
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 10418 | OA
Mciver, A., Morgan, C., Kaminski, B. L., & Katoen, J. P. (2017). A new proof rule for almost-sure termination. Proceedings of the ACM on Programming Languages. Los Angeles, CA, United States: Association for Computing Machinery. https://doi.org/10.1145/3158121
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2017 | Published | Journal Article | IST-REx-ID: 1065 | OA
Chatterjee, K., & Osang, G. F. (2017). Pushdown reachability with constant treewidth. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2017.02.003
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1066
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2017). Quantitative fair simulation games. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2016.10.006
View | Files available | DOI | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 1080 | OA
Reiter, J., Makohon Moore, A., Gerold, J., Božić, I., Chatterjee, K., Iacobuzio Donahue, C., … Nowak, M. (2017). Reconstructing metastatic seeding patterns of human cancers. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms14114
[Published Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 949 | OA
Chatterjee, K., Goharshady, A. K., & Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. https://doi.org/10.1007/978-3-319-68167-2_4
[Submitted Version] View | Files available | DOI | WoS
 
2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
Avni, G., Henzinger, T. A., & Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2017.21
[Published Version] View | Files available | DOI | arXiv
 
2017 | Published | Conference Paper | IST-REx-ID: 1194 | OA
Chatterjee, K., Novotný, P., & Zikelic, D. (2017). Stochastic invariants for probabilistic termination (Vol. 52, pp. 145–160). Presented at the POPL: Principles of Programming Languages, Paris, France: ACM. https://doi.org/10.1145/3009837.3009873
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Published | Journal Article | IST-REx-ID: 464 | OA
Chatterjee, K., Henzinger, M. H., & Loitzenbauer, V. (2017). Improved algorithms for parity and Streett objectives. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017). Edit distance for pushdown automata. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Křetínská, Z., & Kretinsky, J. (2017). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Logical Methods in Computer Science. International Federation of Computational Logic. 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, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata. ACM Transactions on Computational Logic (TOCL). ACM. 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, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2017). Amplification on undirected population structures: Comets beat stars. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/s41598-017-00107-w
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1245
Pandey, V., & Chatterjee, K. (2016). Game-theoretic models identify useful principles for peer collaboration in online learning platforms. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (Vol. 26, pp. 365–368). San Francisco, CA, USA: ACM. https://doi.org/10.1145/2818052.2869122
View | DOI
 
2016 | Published | Journal Article | IST-REx-ID: 1322 | OA
Hilbe, C., Hagel, K., & Milinski, M. (2016). Asymmetric power boosts extortion in an economic experiment. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0163867
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1324
Chatterjee, K., & Chmelik, M. (2016). Indefinite-horizon reachability in Goal-DEC-POMDPs. In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling (Vol. 2016–January, pp. 88–96). London, United Kingdom: AAAI Press.
View | Download None (ext.)
 
2016 | Published | Conference Paper | IST-REx-ID: 1325 | OA
Brázdil, T., Forejt, V., Kučera, A., & Novotný, P. (2016). Stability in graphs and games (Vol. 59). Presented at the CONCUR: Concurrency Theory, Quebec City, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.10
[Published Version] View | Files available | DOI
 
2016 | Published | Conference Paper | IST-REx-ID: 1326 | OA
Brázdil, T., Kučera, A., & Novotný, P. (2016). Optimizing the expected mean payoff in Energy Markov Decision Processes (Vol. 9938, pp. 32–49). Presented at the ATVA: Automated Technology for Verification and Analysis, Chiba, Japan: Springer. https://doi.org/10.1007/978-3-319-46520-3_3
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Published | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Gupta, A., & Novotný, P. (2016). Stochastic shortest path with energy constraints in POMDPs. In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (pp. 1465–1466). Singapore: ACM.
[Preprint] View | Download Preprint (ext.)
 
2016 | Published | Journal Article | IST-REx-ID: 1333 | OA
Milinski, M., Hilbe, C., Semmann, D., Sommerfeld, R., & Marotzke, J. (2016). Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms10915
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed