Wang, Peixin, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, and Ming Xu. “Proving Expected Sensitivity of Probabilistic Programs with Randomized Variable-Dependent Termination Time.”https://doi.org/10.1145/3371093__In Proceedings of the ACM on Programming Languages, Vol. 4. ACM, 2020.https://doi.org/10.1145/3371093 .

Brázdil, Tomás, Krishnendu Chatterjee, Petr Novotný, and Jií Vahala. “Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.”https://doi.org/10.1609/aaai.v34i06.6531__Proceedings of the 34th AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2020.https://doi.org/10.1609/aaai.v34i06.6531 .

Aichholzer, Oswin, Julia Obmann, Pavel Patak, Daniel Perz, and Josef Tkadlec. “Disjoint Tree-Compatible Plane Perfect Matchings.” In 36th European Workshop on Computational Geometry, 2020.

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal and Perfectly Parallel Algorithms for On-Demand Data-Flow Analysis.”https://doi.org/10.1007/978-3-030-44914-8_5__In European Symposium on Programming, 12075:112–40. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-44914-8_5 .

Asadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth.”https://doi.org/10.1007/978-3-030-59152-6_14__In Automated Technology for Verification and Analysis, 12302:253–70. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-59152-6_14 .

Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Ehsan Kafshdar Goharshady. “Polynomial Invariant Generation for Non-Deterministic Recursive Programs.”https://doi.org/10.1145/3385412.3385969__In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, 672–87. Association for Computing Machinery, 2020.https://doi.org/10.1145/3385412.3385969 .

Goharshady, Amir Kafshdar, and Fatemeh Mohammadi. “An Efficient Algorithm for Computing Network Reliability in Small Treewidth.”https://doi.org/10.1016/j.ress.2019.106665__Reliability Engineering and System Safety. Elsevier, 2020.https://doi.org/10.1016/j.ress.2019.106665 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.”https://doi.org/10.4230/LIPICS.CONCUR.2019.7__In Leibniz International Proceedings in Informatics, Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.7 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Long-Run Average Behavior of Vector Addition Systems with States,”https://doi.org/10.4230/LIPICS.CONCUR.2019.27__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.27 .

Chatterjee, Krishnendu, and Nir Piterman. “Combinations of Qualitative Winning for Stochastic Parity Games,”https://doi.org/10.4230/LIPICS.CONCUR.2019.6__Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.CONCUR.2019.6 .

Avni, Guy, Thomas A Henzinger, and Dorde Zikelic. “Bidding Mechanisms in Graph Games,”https://doi.org/10.4230/LIPICS.MFCS.2019.11__Vol. 138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.MFCS.2019.11 .

Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.”https://doi.org/10.1007/978-3-030-11245-5_22__In International Conference on Verification, Model Checking, and Abstract Interpretation, 11388:468–90. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-11245-5_22 .

Avni, Guy, Roderick Bloem, Krishnendu Chatterjee, Thomas A Henzinger, Bettina Konighofer, and Stefan Pranger. “Run-Time Optimization for Learned Controllers through Quantitative Games.”https://doi.org/10.1007/978-3-030-25540-4_36__In 31st International Conference on Computer-Aided Verification, 11561:630–49. Springer, 2019.https://doi.org/10.1007/978-3-030-25540-4_36 .

Hauser, Oliver P., Christian Hilbe, Krishnendu Chatterjee, and Martin A. Nowak. “Social Dilemmas among Unequals.”https://doi.org/10.1038/s41586-019-1488-5__Nature. Springer Nature, 2019.https://doi.org/10.1038/s41586-019-1488-5 .

Ashok, Pranav, Tomás Brázdil, Krishnendu Chatterjee, Jan Ketínský, Christoph Lampert, and Viktor Toman. “Strategy Representation by Decision Trees with Linear Classifiers.”https://doi.org/10.1007/978-3-030-30281-8_7__In 16th International Conference on Quantitative Evaluation of Systems, 11785:109–28. Springer Nature, 2019.https://doi.org/10.1007/978-3-030-30281-8_7 .

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.