Brázdil, Tomás, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, and Dominik Velan. “Deciding Fast Termination for Probabilistic VASS with Nondeterminism.”https://doi.org/10.1007/978-3-030-31784-3_27__In International Symposium on Automated Technology for Verification and Analysis, 11781:462–78. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-31784-3_27 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Population Structure Determines the Tradeoff between Fixation Probability and Fixation Time.”https://doi.org/10.1038/s42003-019-0373-y__Communications Biology. Springer Nature, 2019.https://doi.org/10.1038/s42003-019-0373-y .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Viktor Toman. “Value-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3360550__In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications, Vol. 3. ACM, 2019.https://doi.org/10.1145/3360550 .

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”https://doi.org/10.1109/lics.2019.8785706__In 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. IEEE, 2019.https://doi.org/10.1109/lics.2019.8785706 .

Biniaz, Ahmad, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, and Alexi Turcotte. “Token Swapping on Trees.” ArXiv, n.d.

Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.”https://doi.org/10.1145/3360555__In Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , Vol. 3. ACM, 2019.https://doi.org/10.1145/3360555 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Nastaran Okati, and Andreas Pavlogiannis. “Efficient Parameterized Algorithms for Data Packing.”https://doi.org/10.1145/3290366__Proceedings of the ACM on Programming Languages. ACM, 2019.https://doi.org/10.1145/3290366 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Probabilistic Smart Contracts: Secure Randomness on the Blockchain.”https://doi.org/10.1109/BLOC.2019.8751326__In IEEE International Conference on Blockchain and Cryptocurrency. IEEE, 2019.https://doi.org/10.1109/BLOC.2019.8751326 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Arash Pourdamghani. “Hybrid Mining: Exploiting Blockchain’s Computational Power for Distributed Problem Solving.”https://doi.org/10.1145/3297280.3297319__In Proceedings of the 34th ACM Symposium on Applied Computing, Part 7772:374–81. ACM, 2019.https://doi.org/10.1145/3297280.3297319 .

Wang, Peixin, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, and Wenjun Shi. “Cost Analysis of Nondeterministic Probabilistic Programs.”https://doi.org/10.1145/3314221.3314581__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 .

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 .