Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.

Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.

Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.

Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.

Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.

Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.

Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary innovation. PLoS Computational Biology. 10(9), 7p.

Chatterjee K, Pavlogiannis A, Adlam B, Novak M. 2014. Detailed proofs for “The time scale of evolutionary innovation”, Public Library of Science,10.1371/journal.pcbi.1003818.s001 .

Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2014. Polynomial-time algorithms for energy games with special weight structures. Algorithmica. 70(3), 457–492.

Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.

Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.

Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23, 181–196.

Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.

Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.

Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.

Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.

Chatterjee K, aCki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.

Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185.

Novak S, Chatterjee K, Nowak M. 2013. Density games. Journal of Theoretical Biology. 334, 26–34.

Chatterjee K, Prabhu V. 2013. Quantitative timed simulation functions and refinement metrics for real-time systems. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1, 273–282.

Chatterjee K, Prabhu V. 2013. Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. 228–229, 83–119.

Chatterjee K, Raman V. 2013. Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. 26(4), 825–859.

Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.

Chmelik M, ehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.

Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.

Chatterjee K, Henzinger MH, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.

Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.

Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p.

Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.

Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.

Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with <9-regular objectives, IST Austria, 41p.

Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.

Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.

Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, 18–25.

Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.

Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.

Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p.

Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.

Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma , Public Library of Science,10.1371/journal.pone.0080814.s001 .

Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages. 7th International Conference on Language and Automata Theory and Applications. LATA: Conference on Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.

Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12), e80814.

Reiter J, Boei I, Allen B, Chatterjee K, Nowak M. 2013. The effect of one additional driver mutation on tumor progression. Evolutionary Applications. 6(1), 34–45.

Boei I, Reiter J, Allen B, Antal T, Chatterjee K, Shah P, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2, e00747.

Reiter J, Boei I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044, 101–106.

Brázdil T, Chatterjee K, Forejt V, Kudera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science, 331–340.

Chatterjee K, Kößler A, Schmid U. 2013. Automated analysis of real-time scheduling using graph games. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control, 163–172.

Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18, 461–473.

Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.

Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.

Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.

Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.

Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games.  ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 385–399.

Brázdil B, Chatterjee K, Kudera A, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.

Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.

Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.

Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.

Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.

Chatterjee K, Henzinger TA. 2012. A survey of stochastic <9 regular games. Journal of Computer and System Sciences. 78(2), 394–413.

Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.

Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.

Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.

Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.

Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.

Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.

Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.

Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.

Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.

Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.

Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.

Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.

Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.

Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Boei I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540.

Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.

Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems.  SIES: International Symposium on Industrial Embedded Systems, 176–185.

Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.

Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.

Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.

Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.

Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.

Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.

Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).

Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, .

Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.

Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.

Brázdil T, Broeek V, Chatterjee K, Forejt V, Kudera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.

Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.

Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.

Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.

Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.

Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.

Chatterjee K, Henzinger MH. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.

Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.

Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.

Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.

Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.

Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.