Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

527 Publications


2018 | Published | Conference Paper | IST-REx-ID: 141 | OA
Chatterjee, Krishnendu, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. https://doi.org/10.1007/978-3-319-96142-2_13.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 143 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 157 | OA
Hilbe, Christian, Štepán Šimsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.” Nature. Nature Publishing Group, 2018. https://doi.org/10.1038/s41586-018-0277-x.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 454 | OA
Reiter, Johannes, Christian Hilbe, David Rand, Krishnendu Chatterjee, and Martin Nowak. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.” Nature Communications. Nature Publishing Group, 2018. https://doi.org/10.1038/s41467-017-02721-8.
[Published Version] View | Files available | DOI | WoS
 

2018 | Conference Paper | IST-REx-ID: 5679 | OA
Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 5751 | OA
Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.” Communications Biology. Springer Nature, 2018. https://doi.org/10.1038/s42003-018-0078-7.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Book Chapter | IST-REx-ID: 59
Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.” In Handbook of Model 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 | Published | Conference Paper | IST-REx-ID: 5967 | OA
Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, 149–50. ACM, 2018. https://doi.org/10.1145/3219166.3219198.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 5993 | OA
Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.” ACM Transactions on Programming Languages and Systems. Association for Computing Machinery, 2018. https://doi.org/10.1145/3174800.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | arXiv
 

2018 | Published | 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. The Royal Society, 2018. https://doi.org/10.1098/rsif.2018.0073.
[Submitted Version] View | Files available | DOI | WoS | PubMed | Europe PMC
 

2018 | Published | Journal Article | IST-REx-ID: 10417 | OA
Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2018. https://doi.org/10.1145/3158119.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 310 | OA
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. https://doi.org/10.1137/1.9781611975031.151.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 325 | OA
Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,” Vol. 2. ACM, 2018. https://doi.org/10.1145/3158122.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 34 | OA
Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives.” In 28th International Conference on Automated Planning and Scheduling, 2018:47–55. AAAI Press, 2018. https://doi.org/10.1609/icaps.v28i1.13875.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

earlier version | 2018 | Published | 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.
[Preprint] View | Files available | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Journal Article | IST-REx-ID: 419 | OA
Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0320-9.
[Submitted Version] View | Files available | DOI | WoS
 

2018 | Published | Conference Paper | IST-REx-ID: 79 | OA
Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. https://doi.org/10.1007/978-3-319-99154-2_4.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 

2018 | Published | Book Chapter | IST-REx-ID: 86 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
[Submitted Version] View | Files available | DOI
 

2018 | Published | Journal Article | IST-REx-ID: 738 | OA
Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.” Real-Time Systems. Springer, 2018. https://doi.org/10.1007/s11241-017-9293-4.
[Published Version] View | Files available | DOI | WoS
 

2018 | Published | Journal Article | IST-REx-ID: 2 | OA
Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.” PNAS. National Academy of Sciences, 2018. https://doi.org/10.1073/pnas.1810565115.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS | PubMed | Europe PMC
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed