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 .