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 .

Chmelik, Martin, and Vojtbch ehák. “Controllable-Choice Message Sequence Graphs.”https://doi.org/10.1007/978-3-642-36046-6_12__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-36046-6_12 .

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 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.4204/EPTCS.96.3__In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012.https://doi.org/10.4204/EPTCS.96.3 .

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 .

Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.”https://doi.org/10.4204/EPTCS.96.18__In Proceedings GandALF 2012, 96:238–46. Open Publishing Association, 2012.https://doi.org/10.4204/EPTCS.96.18 .

Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.”https://doi.org/10.1109/LICS.2012.65__IEEE, 2012.https://doi.org/10.1109/LICS.2012.65 .

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 .

Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.”https://doi.org/10.1038/nature11219__Nature. Nature Publishing Group, 2012.https://doi.org/10.1038/nature11219 .

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 .