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.




330 Publications

2019 | Conference Paper | IST-REx-ID: 6885   OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,” 140:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. https://doi.org/10.4230/LIPICS.CONCUR.2019.27.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6780   OA
Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . ACM, n.d.
View | Files available | Download (ext.) | arXiv
 
2019 | Journal Article | IST-REx-ID: 6836
Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.” Nature 572, no. 7770 (2019): 524–27. https://doi.org/10.1038/s41586-019-1488-5.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6918
Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.” Reliability Engineering and System Safety 193 (2019): 106665. https://doi.org/10.1016/j.ress.2019.106665.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 143   OA
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotny, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. https://doi.org/10.1145/3209108.3209191.
View | DOI | Download (ext.)
 
2018 | Journal Article | IST-REx-ID: 198   OA
Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.” Journal of the Royal Society Interface 15, no. 140 (2018). https://doi.org/10.1098/rsif.2018.0073.
View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 35   OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.
View | Download (ext.) | arXiv
 
2018 | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Modeling Checking, edited by Thomas A Henzinger, Edmund M. Clarke, Helmut Veith, and Roderick Bloem, 1st ed., 921–62. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_27.
View | DOI
 
2018 | Conference Paper | IST-REx-ID: 66   OA
Chatterjee, Krishnendu, Amir Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies.,” 118:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPIcs.CONCUR.2018.11.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 24   OA
Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotny, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/652.
View | DOI | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed