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.
465 Publications
2019 |Published| Conference Paper | IST-REx-ID: 6175 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.” In PLDI 2019: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 204–20. Association for Computing Machinery, 2019. https://doi.org/10.1145/3314221.3314581.
[Submitted Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |Published| Journal Article | IST-REx-ID: 7158 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3363525.
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 |Published| Journal Article | IST-REx-ID: 7014 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.” ACM Transactions on Programming Languages and Systems. ACM, 2019. https://doi.org/10.1145/3339984.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |Published| Conference Paper | IST-REx-ID: 6490 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.” In Proceedings of the 34th ACM Symposium on Applied Computing, Part F147772:400–408. ACM, 2019. https://doi.org/10.1145/3297280.3297322.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 10883 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018. https://doi.org/10.29007/5z5k.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |Published| Conference Paper | IST-REx-ID: 325 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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| 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| Book Chapter | IST-REx-ID: 86 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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: 454 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |Published| Conference Paper | IST-REx-ID: 143 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
2018 |Published| Journal Article | IST-REx-ID: 157 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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| Conference Paper | IST-REx-ID: 310 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H 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 | Conference Paper | IST-REx-ID: 5679 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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: 419 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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| Conference Paper | IST-REx-ID: 297 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 141 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, Krishnendu, Monika H 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| Journal Article | IST-REx-ID: 293 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.” Nature Human Behaviour. Nature Publishing Group, 2018. https://doi.org/10.1038/s41562-018-0354-z.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Conference Paper | IST-REx-ID: 5967 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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.
[Submitted Version]
View
| Files available
| DOI
| WoS
2018 |Published| Journal Article | IST-REx-ID: 5993 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 (ACM), 2018. https://doi.org/10.1145/3174800.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv