Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “The Treewidth of Smart Contracts.”https://doi.org/10.1145/3297280.3297322__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:400–408. ACM, n.d.https://doi.org/10.1145/3297280.3297322 .

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.”https://doi.org/10.1145/3363525__ACM Transactions on Programming Languages and Systems. ACM, 2019.https://doi.org/10.1145/3363525 .

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst-Case Analysis of Recursive Programs.”https://doi.org/10.1145/3339984__ACM Transactions on Programming Languages and Systems. ACM, 2019.https://doi.org/10.1145/3339984 .

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.”https://doi.org/10.29007/5z5k__In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, 57:233–53. EasyChair, 2018.https://doi.org/10.29007/5z5k .

Agrawal, Sheshansh, Krishnendu Chatterjee, and Petr Novotný. “Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs,”https://doi.org/10.1145/3158122__Vol. 2. ACM, 2018.https://doi.org/10.1145/3158122 .

Bloem, Roderick, Krishnendu Chatterjee, and Barbara Jobstmann. “Graph Games and Reactive Synthesis.”https://doi.org/10.1007/978-3-319-10575-8_27__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 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.”https://doi.org/10.1007/978-3-319-95246-8_9__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 .

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.”https://doi.org/10.1038/s41467-017-02721-8__Nature Communications. Nature Publishing Group, 2018.https://doi.org/10.1038/s41467-017-02721-8 .

Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kudera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,”https://doi.org/10.1145/3209108.3209191__8033:185–94. IEEE, 2018.https://doi.org/10.1145/3209108.3209191 .

Hilbe, Christian, Stepán Simsa, Krishnendu Chatterjee, and Martin Nowak. “Evolution of Cooperation in Stochastic Games.”https://doi.org/10.1038/s41586-018-0277-x__Nature. Nature Publishing Group, 2018.https://doi.org/10.1038/s41586-018-0277-x .

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,”https://doi.org/10.1137/1.9781611975031.151__2341–56. ACM, 2018.https://doi.org/10.1137/1.9781611975031.151 .

Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1007/978-3-030-02768-1_11__edited by Sukyoung Ryu, 11275:181–201. Springer, 2018.https://doi.org/10.1007/978-3-030-02768-1_11 .

Hilbe, Christian, Krishnendu Chatterjee, and Martin Nowak. “Partners and Rivals in Direct Reciprocity.”https://doi.org/10.1038/s41562-018-0320-9__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0320-9 .

Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,”https://doi.org/10.1007/978-3-319-99154-2_4__11024:53–70. Springer, 2018.https://doi.org/10.1007/978-3-319-99154-2_4 .

Brázdil, Tomás, Krishnendu Chatterjee, Jan Kretinsky, and Viktor Toman. “Strategy Representation by Decision Trees in Reactive Synthesis,”https://doi.org/10.1007/978-3-319-89960-2_21__10805:385–407. Springer, 2018.https://doi.org/10.1007/978-3-319-89960-2_21 .

Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,”https://doi.org/10.1007/978-3-319-96142-2_13__10982:178–97. Springer, 2018.https://doi.org/10.1007/978-3-319-96142-2_13 .

Hoffman, Moshe, Christian Hilbe, and Martin Nowak. “The Signal-Burying Game Can Explain Why We Obscure Positive Traits and Good Deeds.”https://doi.org/10.1038/s41562-018-0354-z__Nature Human Behaviour. Nature Publishing Group, 2018.https://doi.org/10.1038/s41562-018-0354-z .

Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The Big Match with a Clock and a Bit of Memory.”https://doi.org/10.1145/3219166.3219198__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 .

Chatterjee, Krishnendu, Hongfei Fu, Petr Novotný, and Rouzbeh Hasheminezhad. “Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.”https://doi.org/10.1145/3174800__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3174800 .

Horák, Karel, Branislav Bosanský, and Krishnendu Chatterjee. “Goal-HSVI: Heuristic Search Value Iteration for Goal-POMDPs.”https://doi.org/10.24963/ijcai.2018/662__In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018–July:4764–70. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/662 .