Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.”https://doi.org/10.4230/LIPIcs.OPODIS.2023.11__In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.https://doi.org/10.4230/LIPIcs.OPODIS.2023.11 .

Hübner, Valentin, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina. “Efficiency and Resilience of Cooperation in Asymmetric Social Dilemmas.”https://doi.org/10.1073/pnas.2315558121__Proceedings of the National Academy of Sciences. Proceedings of the National Academy of Sciences, 2024.https://doi.org/10.1073/pnas.2315558121 .

Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.”https://doi.org/10.1371/journal.pcbi.1012008__PLoS Computational Biology. Public Library of Science, 2024.https://doi.org/10.1371/journal.pcbi.1012008 .

Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.”https://doi.org/10.1137/1.9781611977554.ch173__In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023.https://doi.org/10.1137/1.9781611977554.ch173 .

Chatterjee, Krishnendu, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”https://doi.org/10.1007/978-3-031-30823-9_1__In Tools and Algorithms for the Construction and Analysis of Systems , 13993:3–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-30823-9_1 .

Svoboda, Jakub, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “Coexistence Times in the Moran Process with Environmental Heterogeneity.”https://doi.org/10.1098/rspa.2022.0685__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. The Royal Society, 2023.https://doi.org/10.1098/rspa.2022.0685 .

Schmid, Laura, Farbod Ekbatani, Christian Hilbe, and Krishnendu Chatterjee. “Quantitative Assessment Can Stabilize Indirect Reciprocity under Imperfect Information.”https://doi.org/10.1038/s41467-023-37817-x__Nature Communications. Springer Nature, 2023.https://doi.org/10.1038/s41467-023-37817-x .

Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, Thomas A Henzinger, and Daniela Rus. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”https://doi.org/10.1609/aaai.v37i12.26747__In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:14964–73. Association for the Advancement of Artificial Intelligence, 2023.https://doi.org/10.1609/aaai.v37i12.26747 .

Sun, Yican, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Automated Tail Bound Analysis for Probabilistic Recurrence Relations.”https://doi.org/10.1007/978-3-031-37709-9_2__In Computer Aided Verification, 13966:16–39. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_2 .

Akshay, S., Krishnendu Chatterjee, Tobias Meggendorfer, and Dorde Zikelic. “MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives.”https://doi.org/10.1007/978-3-031-37709-9_5__In International Conference on Computer Aided Verification, 13966:86–112. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-37709-9_5 .

Chatterjee, Krishnendu, Joost P Katoen, Stefanie Mohr, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Objectives.”https://doi.org/10.1007/s10703-023-00411-4__Formal Methods in System Design. Springer Nature, 2023.https://doi.org/10.1007/s10703-023-00411-4 .

Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.”https://doi.org/10.4230/LIPIcs.MFCS.2023.15__In 48th International Symposium on Mathematical Foundations of Computer Science, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.https://doi.org/10.4230/LIPIcs.MFCS.2023.15 .

Ansaripour, Matin, Krishnendu Chatterjee, Thomas A Henzinger, Mathias Lechner, and Dorde Zikelic. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”https://doi.org/10.1007/978-3-031-45329-8_17__In 21st International Symposium on Automated Technology for Verification and Analysis, 14215:357–79. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-45329-8_17 .

Tkadlec, Josef, Kamran Kaveh, Krishnendu Chatterjee, and Martin A. Nowak. “Evolutionary Dynamics of Mutants That Modify Population Structure.”https://doi.org/10.1098/rsif.2023.0355__Journal of the Royal Society, Interface. The Royal Society, 2023.https://doi.org/10.1098/rsif.2023.0355 .

Kleshnina, Maria, Christian Hilbe, Stepan Simsa, Krishnendu Chatterjee, and Martin A. Nowak. “The Effect of Environmental Information on Evolution of Cooperation in Stochastic Games.”https://doi.org/10.1038/s41467-023-39625-9__Nature Communications. Springer Nature, 2023.https://doi.org/10.1038/s41467-023-39625-9 .

Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “: Boosting Liquidity in Payment Channel Networks with Online Admission Control.”https://doi.org/10.1007/978-3-031-47754-6_18__In 27th International Conference on Financial Cryptography and Data Security, 13950:309–25. Springer Nature, 2023.https://doi.org/10.1007/978-3-031-47754-6_18 .

Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jií Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”https://doi.org/10.1145/3585391__Formal Aspects of Computing. Association for Computing Machinery, 2023.https://doi.org/10.1145/3585391 .

Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”https://doi.org/10.1609/aaai.v37i10.26407__In Proceedings of the 37th AAAI Conference on Artificial Intelligence, 37:11926–35. Association for the Advancement of Artificial Intelligence, 2023.https://doi.org/10.1609/aaai.v37i10.26407 .

Zikelic, Dorde, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, and Thomas A Henzinger. “Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees.” In 37th Conference on Neural Information Processing Systems, 2023.

Ahmadi, Ali, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi Hemami, and Dorde Zikelic. “Algorithms and Hardness Results for Computing Cores of Markov Chains.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.”https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11__In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 .

Chatterjee, Krishnendu, Mona Mohammadi, and Raimundo J Saona Urmeneta. “Repeated Prophet Inequality with Near-Optimal Bounds.”https://doi.org/10.48550/ARXIV.2209.14368__ArXiv, n.d.https://doi.org/10.48550/ARXIV.2209.14368 .

Svoboda, Jakub, Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Infection Dynamics of COVID-19 Virus under Lockdown and Reopening.”https://doi.org/10.1038/s41598-022-05333-5__Scientific Reports. Springer Nature, 2022.https://doi.org/10.1038/s41598-022-05333-5 .

Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.”https://doi.org/10.1103/physreve.106.034321__Physical Review E. American Physical Society, 2022.https://doi.org/10.1103/physreve.106.034321 .

Schmid, Laura, Christian Hilbe, Krishnendu Chatterjee, and Martin Nowak. “Direct Reciprocity between Individuals That Use Different Strategy Spaces.”https://doi.org/10.1371/journal.pcbi.1010149__PLOS Computational Biology. Public Library of Science, 2022.https://doi.org/10.1371/journal.pcbi.1010149 .

Chatterjee, Krishnendu, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Finite-Memory Strategies in POMDPs with Long-Run Average Objectives.”https://doi.org/10.1287/moor.2020.1116__Mathematics of Operations Research. Institute for Operations Research and the Management Sciences, 2022.https://doi.org/10.1287/moor.2020.1116 .

Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.”https://doi.org/10.1016/j.jcss.2022.04.003__Journal of Computer and System Sciences. Elsevier, 2022.https://doi.org/10.1016/j.jcss.2022.04.003 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Tobias Meggendorfer, and Dorde Zikelic. “Sound and Complete Certificates for Auantitative Termination Analysis of Probabilistic Programs.”https://doi.org/10.1007/978-3-031-13185-1_4__In Proceedings of the 34th International Conference on Computer Aided Verification, 13371:55–78. Springer, 2022.https://doi.org/10.1007/978-3-031-13185-1_4 .

Lechner, Mathias, Dorde Zikelic, Krishnendu Chatterjee, and Thomas A Henzinger. “Stability Verification in Stochastic Control Systems via Neural Network Supermartingales.”https://doi.org/10.1609/aaai.v36i7.20695__Proceedings of the AAAI Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence, 2022.https://doi.org/10.1609/aaai.v36i7.20695 .

Zikelic, Dorde, Mathias Lechner, Krishnendu Chatterjee, and Thomas A Henzinger. “Learning Stabilizing Policies in Stochastic Control Systems.”https://doi.org/10.48550/arXiv.2205.11991__ArXiv, n.d.https://doi.org/10.48550/arXiv.2205.11991 .

Zikelic, Dorde, Mathias Lechner, Thomas A Henzinger, and Krishnendu Chatterjee. “Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees.”https://doi.org/10.48550/ARXIV.2210.05308__ArXiv, n.d.https://doi.org/10.48550/ARXIV.2210.05308 .

Chatterjee, Krishnendu, Monika H Henzinger, Sagar Sudhir Kale, and Alexander Svozil. “Faster Algorithms for Bounded Liveness in Graphs and Game Graphs.”https://doi.org/10.4230/LIPIcs.ICALP.2021.124__In 48th International Colloquium on Automata, Languages, and Programming, Vol. 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Quantitative Verification on Product Graphs of Small Treewidth.”https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42__In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42 .

Tomásek, Petr, Karel Horák, Aditya Aradhye, Branislav Bosanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.”https://doi.org/10.24963/ijcai.2021/575__In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021.https://doi.org/10.24963/ijcai.2021/575 .

Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.”https://doi.org/10.1007/978-3-030-72016-2__In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-72016-2 .

Lechner, Mathias, Ðore dikeli, Krishnendu Chatterjee, and Thomas A Henzinger. “Infinite Time Horizon Safety of Bayesian Neural Networks.”https://doi.org/10.48550/arXiv.2111.03165__In 35th Conference on Neural Information Processing Systems, 2021.https://doi.org/10.48550/arXiv.2111.03165 .

Zeiner, Martin, Ulrich Schmid, and Krishnendu Chatterjee. “Optimal Strategies for Selecting Coordinators.”https://doi.org/10.1016/j.dam.2020.10.022__Discrete Applied Mathematics. Elsevier, 2021.https://doi.org/10.1016/j.dam.2020.10.022 .

Kleshnina, Maria, Sabrina S. Streipert, Jerzy A. Filar, and Krishnendu Chatterjee. “Mistakes Can Stabilise the Dynamics of Rock-Paper-Scissors Games.”https://doi.org/10.1371/journal.pcbi.1008523__PLoS Computational Biology. Public Library of Science, 2021.https://doi.org/10.1371/journal.pcbi.1008523 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Fast and Strong Amplifiers of Natural Selection.”https://doi.org/10.1038/s41467-021-24271-w__Nature Communications. Springer Nature, 2021.https://doi.org/10.1038/s41467-021-24271-w .

Wang, Jinyi, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Quantitative Analysis of Assertion Violations in Probabilistic Programs.”https://doi.org/10.1145/3453483.3454102__In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1171–86. Association for Computing Machinery, 2021.https://doi.org/10.1145/3453483.3454102 .

Asadi, Ali, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, and Mohammad Mahdavi. “Polynomial Reachability Witnesses via Stellensätze.”https://doi.org/10.1145/3453483.3454076__In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 772–87. Association for Computing Machinery, 2021.https://doi.org/10.1145/3453483.3454076 .

Chatterjee, Krishnendu, Wolfgang Dvorak, Monika H Henzinger, and Alexander Svozil. “Symbolic Time and Space Tradeoffs for Probabilistic Verification.”https://doi.org/10.1109/LICS52264.2021.9470739__In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021.https://doi.org/10.1109/LICS52264.2021.9470739 .

Chatterjee, Krishnendu, and Laurent Doyen. “Stochastic Processes with Expected Stopping Time.”https://doi.org/10.1109/LICS52264.2021.9470595__In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1–13. Institute of Electrical and Electronics Engineers, 2021.https://doi.org/10.1109/LICS52264.2021.9470595 .

Agarwal, Pratyush, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, and Viktor Toman. “Stateless Model Checking under a Reads-Value-from Equivalence.”https://doi.org/10.1007/978-3-030-81685-8_16__In 33rd International Conference on Computer-Aided Verification , 12759:341–66. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-81685-8_16 .

Bui, Truc Lam, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, and Viktor Toman. “The Reads-from Equivalence for the TSO and PSO Memory Models.”https://doi.org/10.1145/3485541__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2021.https://doi.org/10.1145/3485541 .

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.”https://doi.org/10.1016/j.artint.2021.103499__Artificial Intelligence. Elsevier, 2021.https://doi.org/10.1016/j.artint.2021.103499 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Bounded Treewidth Graphs.”https://doi.org/10.1007/s10703-021-00373-5__Formal Methods in System Design. Springer, 2021.https://doi.org/10.1007/s10703-021-00373-5 .

Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, Jií Zárevúcky, and Dorde Zikelic. “On Lexicographic Proof Rules for Probabilistic Termination.”https://doi.org/10.1007/978-3-030-90870-6_33__In 24th International Symposium on Formal Methods, 13047:619–39. Springer Nature, 2021.https://doi.org/10.1007/978-3-030-90870-6_33 .

Chatterjee, Krishnendu, Ehsan Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “Proving Non-Termination by Program Reversal.”https://doi.org/10.1145/3453483.3454093__In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 1033–48. Association for Computing Machinery, 2021.https://doi.org/10.1145/3453483.3454093 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Petr Novotný, and Dorde Zikelic. “RevTerm.”https://doi.org/10.1145/3410304__Association for Computing Machinery, 2021.https://doi.org/10.1145/3410304 .

Schmid, Laura, Pouya Shati, Christian Hilbe, and Krishnendu Chatterjee. “The Evolution of Indirect Reciprocity under Action and Assessment Generosity.”https://doi.org/10.1038/s41598-021-96932-1__Scientific Reports. Springer Nature, 2021.https://doi.org/10.1038/s41598-021-96932-1 .

Schmid, Laura, Krishnendu Chatterjee, Christian Hilbe, and Martin A. Nowak. “A Unified Framework of Direct and Indirect Reciprocity.”https://doi.org/10.1038/s41562-021-01114-8__Nature Human Behaviour. Springer Nature, 2021.https://doi.org/10.1038/s41562-021-01114-8 .

Schmid, Laura, Krishnendu Chatterjee, and Stefan Schmid. “The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game.”https://doi.org/10.4230/LIPIcs.OPODIS.2019.21__In Proceedings of the 23rd International Conference on Principles of Distributed Systems, Vol. 153. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.OPODIS.2019.21 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States.”https://doi.org/10.4230/LIPIcs.CONCUR.2020.23__In 31st International Conference on Concurrency Theory, Vol. 171. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.CONCUR.2020.23 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Simplified Game of Life: Algorithms and Complexity.”https://doi.org/10.4230/LIPIcs.MFCS.2020.22__In 45th International Symposium on Mathematical Foundations of Computer Science, Vol. 170. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.MFCS.2020.22 .

Ashok, Pranav, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. “Approximating Values of Generalized-Reachability Stochastic Games.”https://doi.org/10.1145/3373718.3394761__In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science , 102–15. Association for Computing Machinery, 2020.https://doi.org/10.1145/3373718.3394761 .

Kaveh, Kamran, Alex McAvoy, Krishnendu Chatterjee, and Martin A. Nowak. “The Moran Process on 2-Chromatic Graphs.”https://doi.org/10.1371/journal.pcbi.1008402__PLOS Computational Biology. Public Library of Science, 2020.https://doi.org/10.1371/journal.pcbi.1008402 .

Kleshnina, Maria, Sabrina Streipert, Jerzy Filar, and Krishnendu Chatterjee. “Prioritised Learning in Snowdrift-Type Games.”https://doi.org/10.3390/math8111945__Mathematics. MDPI, 2020.https://doi.org/10.3390/math8111945 .

Pavlogiannis, Andreas, Nico Schaumberger, Ulrich Schmid, and Krishnendu Chatterjee. “Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling.”https://doi.org/10.1109/TCAD.2020.3012803__IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. IEEE, 2020.https://doi.org/10.1109/TCAD.2020.3012803 .

Chatterjee, Krishnendu, Martin Chmelik, Deep Karkhanis, Petr Novotný, and Amélie Royer. “Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.” In Proceedings of the 30th International Conference on Automated Planning and Scheduling, 30:48–56. Association for the Advancement of Artificial Intelligence, 2020.

Chatterjee, Krishnendu, Joost P Katoen, Maximilian Weininger, and Tobias Winkler. “Stochastic Games with Lexicographic Reachability-Safety Objectives.”https://doi.org/10.1007/978-3-030-53291-8_21__In International Conference on Computer Aided Verification, 12225:398–420. Springer Nature, 2020.https://doi.org/10.1007/978-3-030-53291-8_21 .

Tkadlec, Josef, Andreas Pavlogiannis, Krishnendu Chatterjee, and Martin A. Nowak. “Limits on Amplifiers of Natural Selection under Death-Birth Updating.”https://doi.org/10.1371/journal.pcbi.1007494__PLoS Computational Biology. Public Library of Science, 2020.https://doi.org/10.1371/journal.pcbi.1007494 .

Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Data and Mathematica Notebooks for Plotting Figures from Language Learning with Communication between Learners from Language Acquisition with Communication between Learners.”https://doi.org/10.6084/m9.figshare.5973013.v1__Royal Society, 2020.https://doi.org/10.6084/m9.figshare.5973013.v1 .

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 .

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 .

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 .

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 .

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 .

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 .

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 .

Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,”https://doi.org/10.24963/ijcai.2018/652__2018:4692–99. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/652 .

Chatterjee, Krishnendu, Martin Chemlík, and Ufuk Topcu. “Sensor Synthesis for POMDPs with Reachability Objectives,” 2018:47–55. AAAI Press, 2018.

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Alexander Svozil. “Algorithms and Conditional Lower Bounds for Planning Problems.” In 28th International Conference on Automated Planning and Scheduling . AAAI Press, 2018.

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “Automated Competitive Analysis of Real Time Scheduling with Graph Games.”https://doi.org/10.1007/s11241-017-9293-4__Real-Time Systems. Springer, 2018.https://doi.org/10.1007/s11241-017-9293-4 .

Ibsen-Jensen, Rasmus, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Language Acquisition with Communication between Learners.”https://doi.org/10.1098/rsif.2018.0073__Journal of the Royal Society Interface. The Royal Society, 2018.https://doi.org/10.1098/rsif.2018.0073 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin A. Nowak. “Construction of Arbitrarily Strong Amplifiers of Natural Selection Using Evolutionary Graph Theory.”https://doi.org/10.1038/s42003-018-0078-7__Communications Biology. Springer Nature, 2018.https://doi.org/10.1038/s42003-018-0078-7 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Yaron Velner. “Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies,”https://doi.org/10.4230/LIPIcs.CONCUR.2018.11__Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.https://doi.org/10.4230/LIPIcs.CONCUR.2018.11 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,”https://doi.org/10.1007/978-3-319-89884-1_26__10801:739–67. Springer, 2018.https://doi.org/10.1007/978-3-319-89884-1_26 .

Goharshady, Amir Kafshdar, Ali Behrouz, and Krishnendu Chatterjee. “Secure Credit Reporting on the Blockchain.”https://doi.org/10.1109/Cybermatics_2018.2018.00231__In Proceedings of the IEEE International Conference on Blockchain, 1343–48. IEEE, 2018.https://doi.org/10.1109/Cybermatics_2018.2018.00231 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.”https://doi.org/10.1145/3210257__ACM Transactions on Programming Languages and Systems. Association for Computing Machinery (ACM), 2018.https://doi.org/10.1145/3210257 .

Chatterjee, Krishnendu, Hongfei Fu, Amir Kafshdar Goharshady, and Nastaran Okati. “Computational Approaches for Stochastic Shortest Path on Succinct MDPs.”https://doi.org/10.24963/ijcai.2018/653__In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018:4700–4707. IJCAI, 2018.https://doi.org/10.24963/ijcai.2018/653 .

Hilbe, Christian, Laura Schmid, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Indirect Reciprocity with Private, Noisy, and Incomplete Information.”https://doi.org/10.1073/pnas.1810565115__PNAS. National Academy of Sciences, 2018.https://doi.org/10.1073/pnas.1810565115 .

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for Parity and Streett Objectives.”https://doi.org/10.23638/LMCS-13(3:26)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:26)2017 .

Chatterjee, Krishnendu, Zuzana Ketínská, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.23638/LMCS-13(2:15)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(2:15)2017 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1145/3152769__ACM Transactions on Computational Logic (TOCL). ACM, 2017.https://doi.org/10.1145/3152769 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.23638/LMCS-13(3:23)2017__Logical Methods in Computer Science. International Federation of Computational Logic, 2017.https://doi.org/10.23638/LMCS-13(3:23)2017 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. “Amplification on Undirected Population Structures: Comets Beat Stars.”https://doi.org/10.1038/s41598-017-00107-w__Scientific Reports. Nature Publishing Group, 2017.https://doi.org/10.1038/s41598-017-00107-w .

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. “Optimal Dyck Reachability for Data-Dependence and Alias Analysis.”https://doi.org/10.1145/3158118__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158118 .

Chatterjee, Krishnendu, Bhavya Choudhary, and Andreas Pavlogiannis. Optimal Dyck Reachability for Data-Dependence and Alias Analysis. IST Austria, 2017.https://doi.org/10.15479/AT:IST-2017-870-v1-1 .

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.”https://doi.org/10.1145/3158119__Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2017.https://doi.org/10.1145/3158119 .

Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. Data-Centric Dynamic Partial Order Reduction. IST Austria, 2017.https://doi.org/10.15479/AT:IST-2017-872-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. “Faster Monte Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.”https://doi.org/10.4230/LIPIcs.MFCS.2017.61__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.61 .

Chatterjee, Krishnendu, Monika H Henzinger, and Alexander Svozil. “Faster Algorithms for Mean-Payoff Parity Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.39__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.39 .

Chatterjee, Krishnendu, Kristofer Hansen, and Rasmus Ibsen-Jensen. “Strategy Complexity of Concurrent Safety Games.”https://doi.org/10.4230/LIPIcs.MFCS.2017.55__In Leibniz International Proceedings in Informatics, Vol. 83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.MFCS.2017.55 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “The Cost of Exactness in Quantitative Reachability.”https://doi.org/10.1007/978-3-319-63121-9_18__In Models, Algorithms, Logics and Tools, edited by Luca Aceto, Giorgio Bacci, Anna Ingólfsdóttir, Axel Legay, and Radu Mardare, 10460:367–81. Theoretical Computer Science and General Issues. Springer, 2017.https://doi.org/10.1007/978-3-319-63121-9_18 .

Chatterjee, Krishnendu, Hongfei Fu, and Aniket Murhekar. “Automated Recurrence Analysis for Almost Linear Expected Runtime Bounds.”https://doi.org/10.1007/978-3-319-63387-9_6__edited by Rupak Majumdar and Viktor Kundak, 10426:118–39. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_6 .

Ashok, Pranav, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretinsky, and Tobias Meggendorfer. “Value Iteration for Long Run Average Reward in Markov Decision Processes.”https://doi.org/10.1007/978-3-319-63387-9_10__edited by Rupak Majumdar and Viktor Kundak, 10426:201–21. Springer, 2017.https://doi.org/10.1007/978-3-319-63387-9_10 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Set-Based Symbolic Algorithms for Parity Games,”https://doi.org/10.4230/LIPICS.CSL.2017.18__Vol. 82. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2017.https://doi.org/10.4230/LIPICS.CSL.2017.18 .

Makohon Moore, Alvin, Ming Zhang, Johannes Reiter, Ivana Boei, Benjamin Allen, Deepanjan Kundu, Krishnendu Chatterjee, et al. “Limited Heterogeneity of Known Driver Gene Mutations among the Metastases of Individual Patients with Pancreatic Cancer.”https://doi.org/10.1038/ng.3764__Nature Genetics. Nature Publishing Group, 2017.https://doi.org/10.1038/ng.3764 .

Hilbe, Christian, Vaquero Martinez, Krishnendu Chatterjee, and Martin Nowak. “Memory-n Strategies of Direct Reciprocity.”https://doi.org/10.1073/pnas.1621239114__PNAS. National Academy of Sciences, 2017.https://doi.org/10.1073/pnas.1621239114 .

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1016/j.ic.2016.10.012__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.012 .

Chatterjee, Krishnendu, and Nir Piterman. “Obligation Blackwell Games and P-Automata.”https://doi.org/10.1017/jsl.2016.71__Journal of Symbolic Logic. Cambridge University Press, 2017.https://doi.org/10.1017/jsl.2016.71 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Bidirectional Nested Weighted Automata,”https://doi.org/10.4230/LIPIcs.CONCUR.2017.5__Vol. 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.https://doi.org/10.4230/LIPIcs.CONCUR.2017.5 .

Chatterjee, Krishnendu, and Yaron Velner. “The Complexity of Mean-Payoff Pushdown Games.”https://doi.org/10.1145/3121408__Journal of the ACM. ACM, 2017.https://doi.org/10.1145/3121408 .

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”https://doi.org/10.1016/j.jcss.2017.04.005__Journal of Computer and System Sciences. Academic Press, 2017.https://doi.org/10.1016/j.jcss.2017.04.005 .

Chatterjee, Krishnendu, and Rüdiger Ehlers. “Special Issue: Synthesis and SYNT 2014.”https://doi.org/10.1007/s00236-017-0299-0__Acta Informatica. Springer, 2017.https://doi.org/10.1007/s00236-017-0299-0 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1016/j.nahs.2016.04.006__Nonlinear Analysis: Hybrid Systems. Elsevier, 2017.https://doi.org/10.1016/j.nahs.2016.04.006 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Trading Performance for Stability in Markov Decision Processes.”https://doi.org/10.1016/j.jcss.2016.09.009__Journal of Computer and System Sciences. Elsevier, 2017.https://doi.org/10.1016/j.jcss.2016.09.009 .

Reiter, Johannes, Alvin Makohon Moore, Jeffrey Gerold, Ivana Boei, Krishnendu Chatterjee, Christine Iacobuzio Donahue, Bert Vogelstein, and Martin Nowak. “Reconstructing Metastatic Seeding Patterns of Human Cancers.”https://doi.org/10.1038/ncomms14114__Nature Communications. Nature Publishing Group, 2017.https://doi.org/10.1038/ncomms14114 .

Chatterjee, Krishnendu, and Georg F Osang. “Pushdown Reachability with Constant Treewidth.”https://doi.org/10.1016/j.ipl.2017.02.003__Information Processing Letters. Elsevier, 2017.https://doi.org/10.1016/j.ipl.2017.02.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. “Quantitative Fair Simulation Games.”https://doi.org/10.1016/j.ic.2016.10.006__Information and Computation. Elsevier, 2017.https://doi.org/10.1016/j.ic.2016.10.006 .

Chatterjee, Krishnendu, Bernhard Kragl, Samarth Mishra, and Andreas Pavlogiannis. “Faster Algorithms for Weighted Recursive State Machines.”https://doi.org/10.1007/978-3-662-54434-1_11__edited by Hongseok Yang, 10201:287–313. Springer, 2017.https://doi.org/10.1007/978-3-662-54434-1_11 .

Chatterjee, Krishnendu, Petr Novotný, Guillermo Pérez, Jean Raskin, and Djordje Zikelic. “Optimizing Expectation with Guarantees in POMDPs.” In Proceedings of the 31st AAAI Conference on Artificial Intelligence, 5:3725–32. AAAI Press, 2017.

Priklopil, Tadeas, Krishnendu Chatterjee, and Martin Nowak. “Optional Interactions and Suspicious Behaviour Facilitates Trustful Cooperation in Prisoners Dilemma.”https://doi.org/10.1016/j.jtbi.2017.08.025__https://doi.org/10.1016/j.jtbi.2017.08.025__Journal of Theoretical Biology. Elsevier, 2017.https://doi.org/10.1016/j.jtbi.2017.08.025 .

Chatterjee, Krishnendu, Petr Novotný, and Djordje Zikelic. “Stochastic Invariants for Probabilistic Termination,”https://doi.org/10.1145/3009837.3009873__52:145–60. ACM, 2017.https://doi.org/10.1145/3009837.3009873 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak . “Strong Amplifiers of Natural Selection.”https://doi.org/10.15479/AT:ISTA:51__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:51 .

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Non-Polynomial Worst Case Analysis of Recursive Programs.”https://doi.org/10.1007/978-3-319-63390-9_3__edited by Rupak Majumdar and Viktor Kundak, 10427:41–63. Springer, 2017.https://doi.org/10.1007/978-3-319-63390-9_3 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.”https://doi.org/10.1007/978-3-319-68167-2_4__edited by Deepak D’Souza, 10482:59–66. Springer, 2017.https://doi.org/10.1007/978-3-319-68167-2_4 .

Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,”https://doi.org/10.4230/LIPIcs.MFCS.2016.25__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.25 .

Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,”https://doi.org/10.4230/LIPIcs.ICALP.2016.98__Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ICALP.2016.98 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Limit-Average Automata of Bounded Width,”https://doi.org/10.4230/LIPIcs.MFCS.2016.24__Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.https://doi.org/10.4230/LIPIcs.MFCS.2016.24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Automata under Probabilistic Semantics.”https://doi.org/10.1145/2933575.2933588__In Proceedings of the 31st Annual ACM/IEEE Symposium, 76–85. IEEE, 2016.https://doi.org/10.1145/2933575.2933588 .

Chatterjee, Krishnendu, Wolfgang Dvoák, Monika H Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.”https://doi.org/10.1145/2933575.2935304__In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016.https://doi.org/10.1145/2933575.2935304 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Josef Tkadlec. “Robust Draws in Balanced Knockout Tournaments,” 2016–January:172–79. AAAI Press, 2016.

Pandey, Vineet, and Krishnendu Chatterjee. “Game-Theoretic Models Identify Useful Principles for Peer Collaboration in Online Learning Platforms.”https://doi.org/10.1145/2818052.2869122__In Proceedings of the ACM Conference on Computer Supported Cooperative Work, 26:365–68. ACM, 2016.https://doi.org/10.1145/2818052.2869122 .

Chatterjee, Krishnendu, and Martin Chmelik. “Indefinite-Horizon Reachability in Goal-DEC-POMDPs.” In Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, 2016–January:88–96. AAAI Press, 2016.

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Petr Novotný. “Stochastic Shortest Path with Energy Constraints in POMDPs.” In Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, 1465–66. ACM, 2016.

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative Monitor Automata,”https://doi.org/10.1007/978-3-662-53413-7_2__9837:23–38. Springer, 2016.https://doi.org/10.1007/978-3-662-53413-7_2 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding Legality of a Single Step of Magic: The Gathering,”https://doi.org/10.3233/978-1-61499-672-9-1432__285:1432–39. IOS Press, 2016.https://doi.org/10.3233/978-1-61499-672-9-1432 .

Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives,”https://doi.org/10.1145/2933575.2934513__05-08-July-2016:247–56. IEEE, 2016.https://doi.org/10.1145/2933575.2934513 .

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives.”https://doi.org/10.1016/j.jcss.2016.02.009__Journal of Computer and System Sciences. Elsevier, 2016.https://doi.org/10.1016/j.jcss.2016.02.009 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.”https://doi.org/10.1016/j.artint.2016.01.007__Artificial Intelligence. Elsevier, 2016.https://doi.org/10.1016/j.artint.2016.01.007 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative Interprocedural Analysis. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-523-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic SAT Based Algorithm for Almost Sure Reachability with Small Strategies in Pomdps.” In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016:3225–32. AAAI Press, 2016.

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Amplification on Undirected Population Structures: Comets Beat Stars. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-648-v1-1 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2017-749-v3-1 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2016-728-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,”https://doi.org/10.4230/LIPIcs.ESA.2016.28__Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.https://doi.org/10.4230/LIPIcs.ESA.2016.28 .

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/2837614.2837639__20–22:327–42. ACM, 2016.https://doi.org/10.1145/2837614.2837639 .

Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria, 2016.https://doi.org/10.15479/AT:IST-2017-728-v2-1 .

Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,”https://doi.org/10.1145/2837614.2837624__20–22:733–47. ACM, 2016.https://doi.org/10.1145/2837614.2837624 .

Chatterjee, Krishnendu, Hongfei Fu, and Amir Kafshdar Goharshady. “Termination Analysis of Probabilistic Programs through Positivstellensatz’s,”https://doi.org/10.1007/978-3-319-41528-4_1__9779:3–22. Springer, 2016.https://doi.org/10.1007/978-3-319-41528-4_1 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under Finite-Memory Strategies for Concurrent Mean-Payoff Games.”https://doi.org/10.1137/1.9781611973730.69__In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29. SIAM, 2015.https://doi.org/10.1137/1.9781611973730.69 .

Ibsen-Jensen, Rasmus, Krishnendu Chatterjee, and Martin Nowak. “Computational Complexity of Ecological and Evolutionary Spatial Dynamics.”https://doi.org/10.1073/pnas.1511366112__PNAS. National Academy of Sciences, 2015.https://doi.org/10.1073/pnas.1511366112 .

Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.”https://doi.org/10.1007/978-3-662-47666-6_9__In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_9 .

Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.”https://doi.org/10.1038/srep17147__Scientific Reports. Nature Publishing Group, 2015.https://doi.org/10.1038/srep17147 .

Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.”https://doi.org/10.1098/rspa.2015.0114__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015.https://doi.org/10.1098/rspa.2015.0114 .

Svoreová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.”https://doi.org/10.1145/2728606.2728617__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015.https://doi.org/10.1145/2728606.2728617 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.”https://doi.org/10.1109/TAC.2015.2404612__IEEE Transactions on Automatic Control. IEEE, 2015.https://doi.org/10.1109/TAC.2015.2404612 .

Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”https://doi.org/10.1016/j.ic.2015.03.001__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.001 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.

Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”https://doi.org/10.1007/978-3-662-46681-0_50__9035:517–32. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_50 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”https://doi.org/10.1007/978-3-662-46681-0_12__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_12 .

Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.”https://doi.org/10.1016/j.artint.2014.12.009__Artificial Intelligence. Elsevier, 2015.https://doi.org/10.1016/j.artint.2014.12.009 .

Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.”https://doi.org/10.1016/j.ipl.2014.09.001__https://doi.org/10.1016/j.ipl.2014.09.001__Information Processing Letters. Elsevier, 2015.https://doi.org/10.1016/j.ipl.2014.09.001 .

Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1016/j.tcs.2015.01.050__Theoretical Computer Science. Elsevier, 2015.https://doi.org/10.1016/j.tcs.2015.01.050 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.”https://doi.org/10.1016/j.ic.2015.06.003__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.06.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.”https://doi.org/10.1145/2699430__Journal of the ACM. ACM, 2015.https://doi.org/10.1145/2699430 .

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.”https://doi.org/10.1109/LICS.2015.34__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.34 .

Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.”https://doi.org/10.1016/j.ic.2015.03.010__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.010 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.”https://doi.org/10.1016/j.ic.2015.03.009__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.009 .

Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,”https://doi.org/10.1109/ICRA.2015.7139019__325–30. IEEE, 2015.https://doi.org/10.1109/ICRA.2015.7139019 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-322-v1-1 .

Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2015.32__LICS. IEEE, 2015.https://doi.org/10.1109/LICS.2015.32 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1109/LICS.2015.72__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.72 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v1-1 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v2-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-170-v2-2 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.1007/978-3-662-47666-6_10__In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_10 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-330-v2-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-319-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-334-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v2-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v1-1 .

Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-399-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-325-v2-1 .

Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.”https://doi.org/10.1098/rspb.2015.1041__Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015.https://doi.org/10.1098/rspb.2015.1041 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”https://doi.org/10.1007/s10703-015-0235-2__Formal Methods in System Design. Springer, 2015.https://doi.org/10.1007/s10703-015-0235-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.”https://doi.org/10.1145/2676726.2676979__ACM SIGPLAN Notices. ACM, 2015.https://doi.org/10.1145/2676726.2676979 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.”https://doi.org/10.1145/2676726.2676968__Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015.https://doi.org/10.1145/2676726.2676968 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,”https://doi.org/10.1007/978-3-319-21690-4_9__9206:140–57. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_9 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.”https://doi.org/10.1109/RTSS.2014.9__In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015.https://doi.org/10.1109/RTSS.2014.9 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-340-v1-1 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1145/2728606.2728608__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015.https://doi.org/10.1145/2728606.2728608 .

Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.”https://doi.org/10.3390/g6040413__Games. MDPI, 2015.https://doi.org/10.3390/g6040413 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,”https://doi.org/10.1007/978-3-319-21690-4_10__9206:158–77. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_10 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.”https://doi.org/10.1016/j.tcs.2014.06.031__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2014.06.031 .

Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,”https://doi.org/10.1109/IOT.2014.7030120__85–90. IEEE, 2014.https://doi.org/10.1109/IOT.2014.7030120 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Vojtbch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.”https://doi.org/10.1007/978-3-319-11936-6_8__In https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014.https://doi.org/10.1007/978-3-319-11936-6_8 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.”https://doi.org/10.1007/s00236-013-0191-5__Acta Informatica. Springer, 2014.https://doi.org/10.1007/s00236-013-0191-5 .

Brázdil, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Markov Decision Processes with Multiple Long-Run Average Objectives.”https://doi.org/10.2168/LMCS-10(1:13)2014__Logical Methods in Computer Science. International Federation of Computational Logic, 2014.https://doi.org/10.2168/LMCS-10(1:13)2014 .

Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”https://doi.org/10.1007/s00236-013-0182-6__Acta Informatica. Springer, 2014.https://doi.org/10.1007/s00236-013-0182-6 .

Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.”https://doi.org/10.1145/2597631__Journal of the ACM. ACM, 2014.https://doi.org/10.1145/2597631 .

Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.”https://doi.org/10.1007/978-3-662-44584-6_37__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.1007/978-3-662-44584-6_37 .

Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,”https://doi.org/10.1007/978-3-662-44522-8_1__8634:1–4. Springer, 2014.https://doi.org/10.1007/978-3-662-44522-8_1 .

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”https://doi.org/10.1145/2579821__ACM Transactions on Computational Logic (TOCL). ACM, 2014.https://doi.org/10.1145/2579821 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1145/2629686__ACM Transactions on Computational Logic (TOCL). ACM, 2014.https://doi.org/10.1145/2629686 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,”https://doi.org/10.1007/978-3-662-43951-7_11__8573:122–33. Springer, 2014.https://doi.org/10.1007/978-3-662-43951-7_11 .

Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,”https://doi.org/10.1007/978-3-642-54830-7_16__8412:242–57. Springer, 2014.https://doi.org/10.1007/978-3-642-54830-7_16 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,”https://doi.org/10.1007/978-3-642-54830-7_14__8412:210–25. Springer, 2014.https://doi.org/10.1007/978-3-642-54830-7_14 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,”https://doi.org/10.1145/2562059.2562141__303–12. Springer, 2014.https://doi.org/10.1145/2562059.2562141 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v2-2 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v3-1 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v1-1 .

Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.”https://doi.org/10.1007/978-3-662-43951-7_10__In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014.https://doi.org/10.1007/978-3-662-43951-7_10 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-187-v1-1 .

Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-176-v1-1 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-191-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-305-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-305-v2-1 .

Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-300-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-314-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-170-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-190-v2-2 .

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1007/978-3-642-54013-4_5__In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_5 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.”https://doi.org/10.1371/journal.pcbi.1003818__PLoS Computational Biology. Public Library of Science, 2014.https://doi.org/10.1371/journal.pcbi.1003818 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Novak. “Detailed Proofs for ‘The Time Scale of Evolutionary Innovation.’”https://doi.org/10.1371/journal.pcbi.1003818.s001__Public Library of Science, 2014.https://doi.org/10.1371/journal.pcbi.1003818.s001 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/s00453-013-9843-7__Algorithmica. Springer, 2014.https://doi.org/10.1007/s00453-013-9843-7 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,”https://doi.org/10.1007/978-3-319-08867-9_31__8559:473–90. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_31 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-315-v1-1 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.”https://doi.org/10.4230/LIPIcs.CSL.2013.181__In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.https://doi.org/10.4230/LIPIcs.CSL.2013.181 .

Chatterjee, Krishnendu, Vojtbch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.”https://doi.org/10.1007/978-3-642-45221-5_17__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-45221-5_17 .

Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40313-2 .

Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.”https://doi.org/10.1007/s10009-011-0207-9__International Journal on Software Tools for Technology Transfer. Springer, 2013.https://doi.org/10.1007/s10009-011-0207-9 .

Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.”https://doi.org/10.1007/978-3-642-39799-8_37__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_37 .

Chatterjee, Krishnendu, and Jakub aCki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.”https://doi.org/10.1007/978-3-642-39799-8_36__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_36 .

Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.”https://doi.org/10.1142/S0129054113400066__International Journal of Foundations of Computer Science. World Scientific Publishing, 2013.https://doi.org/10.1142/S0129054113400066 .

Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.”https://doi.org/10.1016/j.jtbi.2013.05.029__Journal of Theoretical Biology. Elsevier, 2013.https://doi.org/10.1016/j.jtbi.2013.05.029 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.”https://doi.org/10.1145/2461328.2461370__In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 1:273–82. Springer, 2013.https://doi.org/10.1145/2461328.2461370 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.”https://doi.org/10.1016/j.ic.2013.04.003__Information and Computation. Elsevier, 2013.https://doi.org/10.1016/j.ic.2013.04.003 .

Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.”https://doi.org/10.1007/s00165-013-0283-6__Formal Aspects of Computing. Springer, 2013.https://doi.org/10.1007/s00165-013-0283-6 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”https://doi.org/10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences. Elsevier, 2013.https://doi.org/10.1016/j.jcss.2012.12.001 .

Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Ritankar Majumdar, and Vishwanath Raman. “Code Aware Resource Management.”https://doi.org/10.1007/s10703-012-0170-4__Formal Methods in System Design. Springer, 2013.https://doi.org/10.1007/s10703-012-0170-4 .

Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Nisarg Shah. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1007/s10703-012-0180-2__Formal Methods in System Design. Springer, 2013.https://doi.org/10.1007/s10703-012-0180-2 .

Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.”https://doi.org/10.1007/978-3-319-02444-8_10__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-319-02444-8_10 .

Reiter, Johannes, Ivana Bozic, Krishnendu Chatterjee, and Martin Nowak. TTP: Tool for Tumor Progression. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-104-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. “What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives.”https://doi.org/10.4230/LIPIcs.CSL.2013.165__Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.https://doi.org/10.4230/LIPIcs.CSL.2013.165 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-126-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-109-v1-1 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-127-v1-1 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-128-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-144-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.”https://doi.org/10.1109/FMCAD.2013.6679386__In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013.https://doi.org/10.1109/FMCAD.2013.6679386 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-130-v1-1 .

Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-141-v1-1 .

Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation of Alternative Starting Positions for Traditional Board Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-146-v1-1 .

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”https://doi.org/10.1007/978-3-642-40184-8_35__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40184-8_35 .

Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .”https://doi.org/10.1371/journal.pone.0080814.s001__Public Library of Science, 2013.https://doi.org/10.1371/journal.pone.0080814.s001 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.”https://doi.org/10.1007/978-3-642-37064-9_20__In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/10.1007/978-3-642-37064-9_20 .

Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .”https://doi.org/10.1371/journal.pone.0080814__PLoS One. Public Library of Science, 2013.https://doi.org/10.1371/journal.pone.0080814 .

Reiter, Johannes, Ivana Boei, Benjamin Allen, Krishnendu Chatterjee, and Martin Nowak. “The Effect of One Additional Driver Mutation on Tumor Progression.”https://doi.org/10.1111/eva.12020__Evolutionary Applications. Wiley-Blackwell, 2013.https://doi.org/10.1111/eva.12020 .

Boei, Ivana, Johannes Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Moon, et al. “Evolutionary Dynamics of Cancer in Response to Targeted Combination Therapy.”https://doi.org/10.7554/eLife.00747__ELife. eLife Sciences Publications, 2013.https://doi.org/10.7554/eLife.00747 .

Reiter, Johannes, Ivana Boei, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.”https://doi.org/10.1007/978-3-642-39799-8_6__In Proceedings of 25th Int. Conf. on Computer Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_6 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Trading Performance for Stability in Markov Decision Processes.”https://doi.org/10.1109/LICS.2013.39__In 28th Annual ACM/IEEE Symposium, 331–40. IEEE, 2013.https://doi.org/10.1109/LICS.2013.39 .

Chatterjee, Krishnendu, Alexander Kößler, and Ulrich Schmid. “Automated Analysis of Real-Time Scheduling Using Graph Games.”https://doi.org/10.1145/2461328.2461356__In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 163–72. ACM, 2013.https://doi.org/10.1145/2461328.2461356 .

Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,”https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461__18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461 .

Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”https://doi.org/10.1007/978-3-642-32940-1_10__In CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-32940-1_10 .

Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.”https://doi.org/10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology. Elsevier, 2012.https://doi.org/10.1016/j.jtbi.2012.02.021 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .

Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,”https://doi.org/10.1007/978-3-642-33386-6_30__7561:385–99. Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_30 .

Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kudera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,”https://doi.org/10.1007/978-3-642-31424-7_8__7358:23–38. Springer, 2012.https://doi.org/10.1007/978-3-642-31424-7_8 .

Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,”https://doi.org/10.1007/978-3-642-27940-9_11__7148:152–68. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_11 .

Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,”https://doi.org/10.1007/978-3-642-25929-6_3__7119:37–46. Springer, 2012.https://doi.org/10.1007/978-3-642-25929-6_3 .

Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.”https://doi.org/10.1016/j.ic.2011.11.004__Information and Computation. Elsevier, 2012.https://doi.org/10.1016/j.ic.2011.11.004 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.”https://doi.org/10.1142/S0129054112400308__International Journal of Foundations of Computer Science. World Scientific Publishing, 2012.https://doi.org/10.1142/S0129054112400308 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.https://doi.org/10.1016/j.jcss.2011.05.002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.https://doi.org/10.1007/s10703-012-0164-2 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.”https://doi.org/10.1016/j.tcs.2012.07.038__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2012.07.038 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,”https://doi.org/10.4230/LIPIcs.CSL.2012.167__16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.CSL.2012.167 .

Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.”https://doi.org/10.1137/1.9781611973099.109__In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012.https://doi.org/10.1137/1.9781611973099.109 .

Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”https://doi.org/10.1109/LICS.2012.30__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.30 .

Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012.https://doi.org/10.15479/AT:IST-2012-0002 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012.https://doi.org/10.15479/AT:IST-2012-0001 .

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”https://doi.org/10.1109/LICS.2012.28__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.28 .

Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,”https://doi.org/10.1007/978-3-642-28729-9_18__7213:270–85. Springer, 2012.https://doi.org/10.1007/978-3-642-28729-9_18 .

Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.”https://doi.org/10.1109/LICS.2012.29__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.29 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/978-3-642-33090-2_27__In Algorithms – ESA 2012, 7501:301–12. Springer, 2012.https://doi.org/10.1007/978-3-642-33090-2_27 .

Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.”https://doi.org/10.1016/j.tpb.2011.11.003__Theoretical Population Biology. Academic Press, 2012.https://doi.org/10.1016/j.tpb.2011.11.003 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.”https://doi.org/10.1007/978-3-642-24310-3_11__edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011.https://doi.org/10.1007/978-3-642-24310-3_11 .

Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.”https://doi.org/10.1007/978-3-642-22953-4_13__edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22953-4_13 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,”https://doi.org/10.4204/EPTCS.54.6__54:74–86. EPTCS, 2011.https://doi.org/10.4204/EPTCS.54.6 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.https://doi.org/10.1007/978-3-642-19835-9_24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.https://doi.org/10.2168/LMCS-7(4:8)2011 .

Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.

Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1007/978-3-642-22110-1_21__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_21 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,”https://doi.org/10.1007/978-3-642-21254-3_16__6638:216–26. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_16 .

Brázdil, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2011.10__IEEE, 2011.https://doi.org/10.1109/LICS.2011.10 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,”https://doi.org/10.1145/1967701.1967734__221–30. Springer, 2011.https://doi.org/10.1145/1967701.1967734 .

Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.”https://doi.org/10.1007/978-3-642-24288-5_1__edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011.https://doi.org/10.1007/978-3-642-24288-5_1 .

Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,”https://doi.org/10.1137/1.9781611973082.101__1318–36. SIAM, 2011.https://doi.org/10.1137/1.9781611973082.101 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_17 .

Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0009 .

Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0007 .

Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0008 .

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0006 .

Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1109/LICS.2011.33__IEEE, 2011.https://doi.org/10.1109/LICS.2011.33 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0003 .

Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0004 .

Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.”https://doi.org/10.1007/978-3-642-22110-1_20__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_20 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,”https://doi.org/10.1007/978-3-642-22993-0_21__6907:206–18. Springer, 2011.https://doi.org/10.1007/978-3-642-22993-0_21 .

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0001 .

Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,”https://doi.org/10.1007/978-3-642-16242-8_1__6397:1–14. Springer, 2010.https://doi.org/10.1007/978-3-642-16242-8_1 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,”https://doi.org/10.1007/978-3-642-15155-2_23__6281:246–57. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_23 .

Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.”https://doi.org/10.1007/978-3-642-14295-6_36__edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_36 .

Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.”https://doi.org/10.2168/LMCS-6(3:13)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:13)2010 .

Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .

Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,”https://doi.org/10.1007/978-3-642-15375-4_20__6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_20 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,”https://doi.org/10.1007/978-3-642-14162-1_50__6199:599–610. Springer, 2010.https://doi.org/10.1007/978-3-642-14162-1_50 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505__8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages.”https://doi.org/10.1145/1805950.1805953__ACM Transactions on Computational Logic (TOCL). ACM, 2010.https://doi.org/10.1145/1805950.1805953 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,”https://doi.org/10.1007/978-3-642-14295-6_34__6174:380–95. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_34 .

Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.”https://doi.org/10.1007/978-3-642-12029-9_21__edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010.https://doi.org/10.1007/978-3-642-12029-9_21 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.”https://doi.org/10.1016/j.ic.2009.09.006__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.09.006 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.”https://doi.org/10.1016/j.ic.2009.07.004__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.07.004 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.”https://doi.org/10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:10)2010 .

Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0004 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,”https://doi.org/10.1007/978-3-642-14295-6_57__6174:665–69. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_57 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0002 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,”https://doi.org/10.1007/978-3-642-15643-4_1__6252:1–16. Springer, 2010.https://doi.org/10.1007/978-3-642-15643-4_1 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,”https://doi.org/10.1007/978-3-642-15155-2_24__6281:258–69. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_24 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,”https://doi.org/10.4204/EPTCS.25.6__25:22–29. EPTCS, 2010.https://doi.org/10.4204/EPTCS.25.6 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Systems with Limsup and Liminf Objectives,”https://doi.org/10.1007/978-3-642-03092-5_4__5489:32–45. Springer, 2009.https://doi.org/10.1007/978-3-642-03092-5_4 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic Weighted Automata,”https://doi.org/10.1007/978-3-642-04081-8_17__5710:244–58. Springer, 2009.https://doi.org/10.1007/978-3-642-04081-8_17 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.”https://doi.org/10.1145/1614431.1614432__ACM Transactions on Computational Logic (TOCL). ACM, 2009.https://doi.org/10.1145/1614431.1614432 .

Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems.”https://doi.org/10.2168/LMCS-5(2:7)2009__Logical Methods in Computer Science. International Federation of Computational Logic, 2009.https://doi.org/10.2168/LMCS-5(2:7)2009 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,”https://doi.org/10.1007/978-3-642-03409-1_2__5699:3–13. Springer, 2009.https://doi.org/10.1007/978-3-642-03409-1_2 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,”https://doi.org/10.1007/978-3-642-02930-1_1__5556:1–15. Springer, 2009.https://doi.org/10.1007/978-3-642-02930-1_1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,”https://doi.org/10.1007/978-3-642-03816-7_4__5734:34–54. Springer, 2009.https://doi.org/10.1007/978-3-642-03816-7_4 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Termination Criteria for Solving Concurrent Safety and Reachability Games,”https://doi.org/10.1137/1.9781611973068.23__197–206. SIAM, 2009.https://doi.org/10.1137/1.9781611973068.23 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages,”https://doi.org/10.1109/LICS.2009.16__199–208. IEEE, 2009.https://doi.org/10.1109/LICS.2009.16 .

Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,”https://doi.org/10.1007/978-3-642-02658-4_14__5643:140–56. Springer, 2009.https://doi.org/10.1007/978-3-642-02658-4_14 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Alpaga: A Tool for Solving Parity Games with Imperfect Information,”https://doi.org/10.1007/978-3-642-00768-2_7__5505:58–61. Springer, 2009.https://doi.org/10.1007/978-3-642-00768-2_7 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. Gist: A Solver for Probabilistic Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0003 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. Improved Lower Bounds for Request-Response and Finitary Streett Games. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0002 .

Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0004 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. Qualitative Analysis of Partially-Observable Markov Decision Processes. IST Austria, 2009.https://doi.org/10.15479/AT:IST-2009-0001 .

Adler, B Thomas, Krishnendu Chatterjee, Luca De Alfaro, Marco Faella, Ian Pye, and Vishwanath Raman. “Assigning Trust to Wikipedia Content.”https://doi.org/10.1145/1822258.1822293__ACM, 2008.https://doi.org/10.1145/1822258.1822293 .

Chatterjee, Krishnendu, Luca De Alfaro, and Ian Pye. “Robust Content-Driven Reputation,”https://doi.org/10.1145/1456377.1456387 __33–42. ACM, 2008.https://doi.org/10.1145/1456377.1456387  .

Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics,”https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745__2:107–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008.https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1745 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Koushik Sen. “Model-Checking Omega-Regular Properties of Interval Markov Chains,”https://doi.org/10.1007/978-3-540-78499-9_22__4962:302–17. Springer, 2008.https://doi.org/10.1007/978-3-540-78499-9_22 .

Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Controller Synthesis with Budget Constraints,”https://doi.org/DOI: 10.1007/978-3-540-78929-1_6__4981:72–86. Springer, 2008.https://doi.org/DOI: 10.1007/978-3-540-78929-1_6 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness,”https://doi.org/10.1007/978-3-540-85778-5_10__5215:124–40. Springer, 2008.https://doi.org/10.1007/978-3-540-85778-5_10 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Barbara Jobstmann. “Environment Assumptions for Synthesis,”https://doi.org/10.1007/978-3-540-85361-9_14__5201:147–61. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008.https://doi.org/10.1007/978-3-540-85361-9_14 .

Chatterjee, Krishnendu, Luca De Alfaro, and Ritankar Majumdar. “The Complexity of Coverage,”https://doi.org/10.1007/978-3-540-89330-1_7__5356:91–106. Springer, 2008.https://doi.org/10.1007/978-3-540-89330-1_7 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading Infinite Memory for Uniform Randomness in Timed Games,”https://doi.org/10.1007/978-3-540-78929-1_7__4981:87–100. Springer, 2008.https://doi.org/10.1007/978-3-540-78929-1_7 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Quantitative Languages,”https://doi.org/10.1007/978-3-540-87531-4_28__5213:385–400. Springer, 2008.https://doi.org/10.1007/978-3-540-87531-4_28 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Value Iteration.”https://doi.org/10.1007/978-3-540-69850-0_7__In 25 Years in Model Checking, 5000:107–38. Springer, 2008.https://doi.org/10.1007/978-3-540-69850-0_7 .

Berwanger, Dietmar, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, and Sangram Raje. “Strategy Construction for Parity Games with Imperfect Information,”https://doi.org/10.1007/978-3-540-85361-9__5201:325–39. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2008.https://doi.org/10.1007/978-3-540-85361-9 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Reduction of Stochastic Parity to Stochastic Mean-Payoff Games.”https://doi.org/10.1016/j.ipl.2007.08.035__Information Processing Letters. Elsevier, 2008.https://doi.org/10.1016/j.ipl.2007.08.035 .

Chatterjee, Krishnendu, Arkadeb Ghosal, Thomas A Henzinger, Daniel Iercan, Christoph Kirsch, Claudio Pinello, and Alberto Sangiovanni Vincentelli. “Logical Reliability of Interacting Real-Time Tasks,”https://doi.org/10.1145/1403375.1403595__909–14. IEEE, 2008.https://doi.org/10.1145/1403375.1403595 .

Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Stochastic Limit-Average Games Are in EXPTIME.”https://doi.org/10.1007/s00182-007-0110-5__International Journal of Game Theory. Springer, 2008.https://doi.org/10.1007/s00182-007-0110-5 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Generalized Parity Games,”https://doi.org/10.1007/978-3-540-71389-0_12__4423:153–67. Springer, 2007.https://doi.org/10.1007/978-3-540-71389-0_12 .

Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives.”https://doi.org/10.1016/j.tcs.2007.07.047__Theoretical Computer Science. Elsevier, 2007.https://doi.org/10.1016/j.tcs.2007.07.047 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic,”https://doi.org/10.1007/978-3-540-74407-8_5__4703:59–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007.https://doi.org/10.1007/978-3-540-74407-8_5 .

De Alfaro, Luca, Krishnendu Chatterjee, Marco Faella, and Axel Legay. “Qualitative Logics and Equivalences for Probabilistic Systems,”https://doi.org/10.1109/QEST.2007.15__237–48. IEEE, 2007.https://doi.org/10.1109/QEST.2007.15 .

Chatterjee, Krishnendu. “Markov Decision Processes with Multiple Long-Run Average Objectives,”https://doi.org/10.1007/978-3-540-77050-3_39__4855:473–84. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007.https://doi.org/10.1007/978-3-540-77050-3_39 .

Chatterjee, Krishnendu. “Stochastic Müller Games Are PSPACE-Complete,”https://doi.org/10.1007/978-3-540-77050-3_36__4855:436–48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2007.https://doi.org/10.1007/978-3-540-77050-3_36 .

Chatterjee, Krishnendu. “Optimal Strategy Synthesis in Stochastic Müller Games,”https://doi.org/10.1007/978-3-540-71389-0_11__4423:138–52. Springer, 2007.https://doi.org/10.1007/978-3-540-71389-0_11 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Assume-Guarantee Synthesis,”https://doi.org/10.1007/978-3-540-71209-1_21__4424:261–75. Springer, 2007.https://doi.org/10.1007/978-3-540-71209-1_21 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information.”https://doi.org/10.2168/LMCS-3(3:4)2007__Logical Methods in Computer Science. International Federation of Computational Logic, 2007.https://doi.org/10.2168/LMCS-3(3:4)2007 .

Chatterjee, Krishnendu. “Stochastic <9-Regular Games.” University of California, Berkeley, 2007.

Chatterjee, Krishnendu, Rhada Jagadeesan, and Corin Pitcher. “Games for Controls,”https://doi.org/10.1109/CSFW.2006.14__70–82. IEEE, 2006.https://doi.org/10.1109/CSFW.2006.14 .

Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives,”https://doi.org/10.1007/11874683_18__4207:271–86. Springer, 2006.https://doi.org/10.1007/11874683_18 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Algorithms for Büchi Games.” ACM, 2006.

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Quantitative Concurrent Parity Games,”https://doi.org/10.1145/1109557.1109631__678–87. SIAM, 2006.https://doi.org/10.1145/1109557.1109631 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Algorithms for Omega-Regular Games with Imperfect Information,”https://doi.org/10.1007/11874683_19__4207:287–302. Springer, 2006.https://doi.org/10.1007/11874683_19 .

Chatterjee, Krishnendu. “Concurrent Games with Tail Objectives,”https://doi.org/10.1007/11874683_17__4207:256–70. Springer, 2006.https://doi.org/10.1007/11874683_17 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement for Stochastic Rabin and Streett Games,”https://doi.org/10.1007/11817949_25__4137:375–89. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2006.https://doi.org/10.1007/11817949_25 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games,”https://doi.org/10.1007/11691372_17__3920:257–71. Springer, 2006.https://doi.org/10.1007/11691372_17 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games,”https://doi.org/10.1007/11672142_42__3884:512–23. Springer, 2006.https://doi.org/10.1007/11672142_42 .

Chatterjee, Krishnendu, Ritankar Majumdar, and Thomas A Henzinger. “Markov Decision Processes with Multiple Objectives,”https://doi.org/10.1007/11672142_26__3884:325–36. Springer, 2006.https://doi.org/10.1007/11672142_26 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziski. “Games with Secure Equilibria.”https://doi.org/10.1016/j.tcs.2006.07.032__Theoretical Computer Science. Elsevier, 2006.https://doi.org/10.1016/j.tcs.2006.07.032 .

Chatterjee, Krishnendu, Luca De Alfaro, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and Mariëlle Stoelinga. “Compositional Quantitative Reasoning,”https://doi.org/10.1109/QEST.2006.11__179–88. IEEE, 2006.https://doi.org/10.1109/QEST.2006.11 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability Games,”https://doi.org/10.1109/QEST.2006.48__291–300. IEEE, 2006.https://doi.org/10.1109/QEST.2006.48 .

Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures,”https://doi.org/10.1007/978-3-540-30536-1_13__3326:89–102. Springer, 2005.https://doi.org/10.1007/978-3-540-30536-1_13 .

Chatterjee, Krishnendu. “Two-Player Nonzero-Sum <9-Regular Games,”https://doi.org/10.1007/11539452_32__3653:413–27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005.https://doi.org/10.1007/11539452_32 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziski. “Games with Secure Equilibria,”https://doi.org/10.1007/11561163_7__3657:141–61. Springer, 2005.https://doi.org/10.1007/11561163_7 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Semiperfect-Information Games,”https://doi.org/10.1007/11590156_1__3821:1–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2005.https://doi.org/10.1007/11590156_1 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “The Complexity of Stochastic Rabin and Streett Games,”https://doi.org/10.1007/11523468_71__3580:878–90. Springer, 2005.https://doi.org/10.1007/11523468_71 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziski. “Mean-Payoff Parity Games,”https://doi.org/10.1109/LICS.2005.26__178–87. IEEE, 2005.https://doi.org/10.1109/LICS.2005.26 .

Chakrabarti, Arindam, Krishnendu Chatterjee, Thomas A Henzinger, Orna Kupferman, and Ritankar Majumdar. “Verifying Quantitative Properties Using Bound Functions,”https://doi.org/10.1007/11560548_7__3725:50–64. Springer, 2005.https://doi.org/10.1007/11560548_7 .

Chatterjee, Krishnendu, Thomas A Henzinger, Ranjit Jhala, and Ritankar Majumdar. “Counterexample-Guided Planning,” 104–11. AUAI Press, 2005.

Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziski. “On Nash Equilibria in Stochastic Games,”https://doi.org/10.1007/978-3-540-30124-0_6__3210:26–40. Springer, 2004.https://doi.org/10.1007/978-3-540-30124-0_6 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Marcin Jurdziski. “Games with Secure Equilibria,”https://doi.org/10.1109/LICS.2004.1319610__160–69. IEEE, 2004.https://doi.org/10.1109/LICS.2004.1319610 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Trading Memory for Randomness,”https://doi.org/10.1109/QEST.2004.10051__206–17. IEEE, 2004.https://doi.org/10.1109/QEST.2004.10051 .

Chatterjee, Krishnendu, Marcin Jurdziski, and Thomas A Henzinger. “Quantitative Stochastic Parity Games,” 121–30. SIAM, 2004.

Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs.”https://doi.org/10.1016/j.ic.2004.06.001__Information and Computation. Elsevier, 2004.https://doi.org/10.1016/j.ic.2004.06.001 .

Chatterjee, Krishnendu, Marcin Jurdziski, and Thomas A Henzinger. “Simple Stochastic Parity Games,”https://doi.org/10.1007/978-3-540-45220-1_11__2803:100–113. Springer, 2003.https://doi.org/10.1007/978-3-540-45220-1_11 .

Chatterjee, Krishnendu, Di Ma, Ritankar Majumdar, Tian Zhao, Thomas A Henzinger, and Jens Palsberg. “Stack Size Analysis for Interrupt-Driven Programs,”https://doi.org/10.1007/3-540-44898-5_7__2694:109–26. Springer, 2003.https://doi.org/10.1007/3-540-44898-5_7 .

Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.”https://doi.org/10.1023/A:1023217515688__Journal of Automated Reasoning. Springer, 2003.https://doi.org/10.1023/A:1023217515688 .

Mallick, Sanhita, Krishnendu Chatterjee, Arif Merchant, and Pallab Dasgupta. “Implementation of Shape Grammar for Plan Analysis.” Elsevier, 2002.

Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted Quantified Computation Tree Logic.” Elsevier, 2001.