Please note that IST 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.

350 Publications


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.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | 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 1, no. 1 (2018). https://doi.org/10.1038/s42003-018-0078-7.
View | Files available | DOI
 

2018 | 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 | 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 Press, 2018. https://doi.org/10.1145/3219166.3219198.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 5977 | OA
Chatterjee, Krishnendu, Hongfei Fu, Amir Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.” In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018. https://doi.org/10.24963/ijcai.2018/653.
View | DOI | Download Preprint (ext.) | arXiv
 

2018 | 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 40, no. 2 (2018): 7. https://doi.org/10.1145/3174800.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 6009 | OA
Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.” ACM Transactions on Programming Languages and Systems 40, no. 3 (2018): 9. https://doi.org/10.1145/3210257.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2018 | Journal Article | IST-REx-ID: 293 | OA
Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour 2 (2018): 397–404. https://doi.org/10.1038/s41562-018-0354-z.
View | Files available | DOI
 

2018 | Conference Paper | IST-REx-ID: 297 | OA
Brázdil, Tomáš, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,” 10805:385–407. Springer, 2018. https://doi.org/10.1007/978-3-319-89960-2_21.
View | Files available | DOI
 

2018 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications