best viewed at 1024x768px

Main Content


2016

  • Krishnendu Chatterjee, Hongfei Fu, and Amir Kafshdar Goharshady. Termination Analysis of Probabilistic Programs through Positivstellensatz's Proc. of CAV, 2016.

  • Krishnendu Chatterjee and Laurent Doyen. Computation Tree Logic for Synchronization Properties Proc. of ICALP, 2016.

  • Vineet Pandey and Krishnendu Chatterjee. Game-theoretic models identify useful principles for peer collaboration in online learning platforms. Proc. of CSCW Companion, 2016.

  • Krishnendu Chatterjee, Wolfgang Dvorak, Monika Henzinger, and Veronika Loitzenbauer. Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. Proc. of LICS, 2016.

  • Krishnendu Chatterjee, and Laurent Doyen. Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives. Proc. of LICS, 2016.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Quantitative Automata under Probabilistic Semantics. Proc. of LICS, 2016.

  • Krishnendu Chatterjee, Rasmus Ibsen-Jensen, and Josef Tkadlec. Robust Draws in Balanced Knockout Tournaments. Proc. of IJCAI, 2016.

  • Krishnendu Chatterjee, and Martin Chmelik. Optimal Cost Indefinite-Horizon Reachability in Goal DEC-POMDPs. Proc. of ICAPS, 2016.

  • Tomas Brazdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, and Peter Novotny. Stochastic Shortest Path with Energy Constraints in POMDPs. Proc. of AAMAS, 2016.

  • Krishnendu Chatterjee, Martin Chmelik, and Jessica Davies. A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs. Proc. of AAAI, 2016.

  • Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Amir Kafshdar Goharshady. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. Proc. of POPL, 2016.

  • Krishnendu Chatterjee, Hongfei Fu, Rouzbeh Hasheminezhad, and Petr Novotny. Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. Proc. of POPL, 2016.

  • Maria Svorenova, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerna, and Calin Belta. Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. Nonlinear Analysis: Hybrid Systems.

  • Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta and Ayush Kanodia. Optimal Cost Almost-sure Reachability in POMDPs. AI Journal.

  • Krishnendu Chatterjee, Martin Chmelik and Mathieu Tracol. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. JCSS.

  • Rasmus Ibsen-Jensen, Krishnendu Chatterjee and Martin A. Nowak. The computational complexity of ecological and evolutionary spatial dynamics. PNAS.

  • Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot and Jean-Francois Raskin. Doomsday Equilibria for Omega-Regular Games. Information and Computation.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop and Yaron Velner. Quantitative Fair Simulation Games. Information and Computation.


2015

  • Tomas Brazdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Proc. of CAV, 2015.

  • Krishnendu Chatterjee, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. Proc. of CAV, 2015.

  • Krishnendu Chatterjee, Laurent Doyen, and Moshe Vardi. The Complexity of Synthesis from Probabilistic Components. Proc. of ICALP, 2015.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. Proc. of ICALP, 2015.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Jan Otop. Nested Weighted Automata. Proc. of LICS, 2015.

  • Krishnendu Chatterjee, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Proc. of LICS, 2015.

  • Krishnendu Chatterjee, Monika Henzinger, and Veronika Loitzenbauer. Improved Algorithms for One-Pair and k-Pair Streett Objectives. Proc. of LICS, 2015.

  • Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. Proc. of ICRA, 2015.

  • Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs, and Robert Koenighofer. Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. Proc. of TACAS, 2015.

  • Tomas Brazdil, Krishnendu Chatterjee, Vojtech Forejt, and Antonin Kucera. MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. Proc. of TACAS, 2015.

  • Maria Svorenova, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerna, and Calin Belta. Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. Proc. of HSCC, 2015.

  • Maria Svorenova, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerna, and Calin Belta. Temporal Logic Motion Planning using POMDPs with Parity Objectives. Proc. of HSCC, 2015.

  • Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta and Ayush Kanodia. Optimal Cost Almost-sure Reachability in POMDPs. Proc. of AAAI, 2015.

  • Umair Z. Ahmed, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation of Alternative Starting Positions for Traditional Board Games (Selected for Oral Presentation). Proc. of AAAI, 2015.

  • Krishnendu Chatterjee, Prateesh Goyal, Rasmus Ibsen-Jensen and Andreas Pavlogiannis. Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. Proc. of POPL, 2015.

  • Krishnendu Chatterjee, Andreas Pavlogiannis and Yaron Velner. Quantitative Interprocedural Analysis. Proc. of POPL, 2015.

  • Krishnendu Chatterjee and Rasmus Ibsen-Jensen. The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. Proc. of SODA, 2015.

  • Andreas Pavlogiannis, Krishnendu Chatterjee, Ben Adlam and Martin A. Nowak. Cellular cooperation with shift updating and repulsion. Nature Scientific Reports

  • Tadeas Priklopil and Krishnendu Chatterjee. Evolution of decisions in population games with sequentially searching individuals. GAMES.

  • Krishnendu Chatterjee, Martin Chmelik and Przemyslaw Daca. CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes. FMSD (Formal Methods in Systems Design).

  • Beatrice Berard, Krishnendu Chatterjee and Nathalie Sznajder. Probabilistic Opacity for Markov Decision Processes. IPL (Information Processing Letters).

  • Ben Adlam, Krishnendu Chatterjee, and Martin A. Nowak. Amplifiers of Selection. Proceedings of the Royal Society A (Proc R Soc A).

  • Johannes Reiter, Ayush Kanodia, Raghav Gupta, Martin A. Nowak and Krishnendu Chatterjee. Biological Auctions with Multiple Rewards. Proceedings of the Royal Society B (Proc R Soc B).

  • Krishnendu Chatterjee and Martin Chmelik. POMDPs under Probablistic Semantics. AI Journal.

  • Krishnendu Chatterjee and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-payoff Games. Information and Computation.

  • Krishnendu Chatterjee, Laurent Doyen, Mickael Randour and Jean-Francois Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Information and Computation.

  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert and Thomas A. Henzinger. Randomness for Free. Information and Computation.

  • Krishnendu Chatterjee, Manas Joglekar and Nisarg Shah. Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B\"uchi Objectives. Theoretical Computer Science (TCS).

  • Makohon-Moore, A., Zhang, M., Reiter, J. G., Bozic, I., Wong, F., Jiao, Y., Chatterjee, K., Nowak, M. A., Papadopoulos, N., Vogelstein, B., Kinzler, K.W., Iacobuzio- Donahue, C. A. Clonal evolution defines the natural history of metastatic pancreatic cancer. Journal of Cancer Research

  • Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and Jean-Francois Raskin. The Complexity of Multi-Mean-Payoff and Multi-Energy Games. Information and Computation.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, and Rohit Singh. Measuring and Synthesizing Systems in Probabilistic Environments. JACM.

  • Krishnendu Chatterjee and Vinayak P. Prabhu. Quantitative Temporal Simulation and Refinement Distances for Timed Systems. IEEE Trans. on Automatic Control (TACON).


2014

  • Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander K"ossler, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. Proc. of RTSS, 2014.

  • Krishnendu Chatterjee. Multidimensional Quantitative Games and Markov Decision Processes (Invited Tutorial). Proc. of ATVA, 2014.

  • Krishnendu Chatterjee. The Complexity Landscape of Partial-observation Stochastic Games (Invited Talk). Proc. of ATVA, 2014.

  • Tomas Brazdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker and Mateusz Ujma Verification of Markov Decision Processes using Learning Algorithms. Proc. of ATVA, 2014.

  • Krishnendu Chatterjee, Ruediger Ehlers and Susmit Jha (volumer editors). SYNT 2014.

  • Krishnendu Chatterjee. Qualitative Concurrent Parity Games: Bounded Rationality Proc. of CONCUR, 2014.

  • Krishnendu Chatterjee. Partial-observation Stochastic Reachability and Parity Games. Proc. of MFCS (Invited paper), 2014.

  • Susmit Jha, Stavros Tripakis, Sanjit Seshia and Krishnendu Chatterjee. Game Theoretic Secure Localization in Wireless Sensor Networks. Proc. of IoT (Internet of Things), 2014.

  • Krishnendu Chatterjee, Martin Chmelik and Przemyslaw Daca. CEGAR for Qualitative Analysis of Probabilistic Systems. Proc. of CAV, 2014.

  • Krishnendu Chatterjee and Rasmus Ibsen-Jensen. The Complexity of Ergodic Mean-payoff Games. Proc. of ICALP, 2014.

  • Krishnendu Chatterjee and Laurent Doyen. Games with a Weak Adversary. Proc. of ICALP, 2014.

  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. Proc. of FOSSACS, 2014.

  • Krishnendu Chatterjee, Laurent Doyen, Sumit Nain and Moshe Y. Vardi. The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies. Proc. of FOSSACS, 2014.

  • Krishnendu Chatterjee, Rasmus Ibsen-Jensen and Rupak Majumdar. Edit distance for Timed Automata. Proc. of HSCC, 2014.

  • Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot and Jean-Francois Raskin. Doomsday Equilibria for Omega-Regular Games. Proc. of VMCAI, 2014.

  • Krishnendu Chatterjee and Jiri Sgall (volumer editors). Information and Computation Speical Issue of MFCS 2013.

  • Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam and Martin A. Nowak. The Time Scale of Evolutionary Innovation. PLOS Computational Biology

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. Approximating the minimum cycle mean. Theoretical Computer Science.

  • Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger and Orna kupferman. Temporal Specifications with Accumulative Values. ACM ToCL.

  • Krishnendu Chatterjee and Monika Henzinger. Efficient and Dynamic Algorithms for Alternating B\"uchi Games and Maximal End-component Decomposition. JACM.


2013

  • Krishnendu Chatterjee, Vojtech Forejt, and Dominik Wojtczak. Multi-objective discounted reward verification in graphs and MDPs. Proc. of LPAR-19.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. Proc. of FMCAD, 2013.

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger and Veronika Loitzenbauer. Approximating the minimum cycle mean. Proc. of GANDALF, 2013.

  • Krishnendu Chatterjee, Martin Chmelik and Mathieu Tracol. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. Proc. of CSL, 2013.

  • Krishnendu Chatterjee and Nathanael Fijalkow. Infinite-state games with finitary conditions. Proc. of CSL, 2013.

  • Krishnendu Chatterjee, Laurent Doyen, Mickael Randour and Jean-Francois Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. Proc. of ATVA, 2013.

  • Krishnendu Chatterjee and Yaron Velner. Hyperplane Separation Technique for Multidimensional Mean-Payoff Games. Proc. of CONCUR, 2013.

  • Krishnendu Chatterjee and Jiri Sgall (volumer editors). MFCS 2013.

  • Krishnendu Chatterjee and Martin Chmelik. POMDPs under Probablistic Semantics. Proc. of UAI, 2013 (Selected also for Oral Presentation).

  • Tomas Brazdil, Krishnendu Chatterjee, Vojtech Forejt and Antonin Kucera. Trading Performance for Stability in Markov Decision Processes. Proc. of LICS, 2013.

  • Krishnendu Chatterjee, Andreas Gaiser and Jan Kretinsky. Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. Proc. of CAV, 2013.

  • Krishnendu Chatterjee and Jakub Lacki. Faster Algorithms for Markov Decision Processes with Low Treewidth. Proc. of CAV, 2013.

  • Johannes G. Reiter, Ivana Bozic, Krishnendu Chatterjee and Martin A. Nowak. TTP: Tool for Tumor Progression. Proc. of CAV, 2013.

  • Krishnendu Chatterjee and Vinayak Prabhu. Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems. Proc. of HSCC, 2013.

  • Krishnendu Chatterjee, Alexander K"ossler, and Ulrich Schmid. Automated Analysis of Real-Time Scheduling using Graph Games. Proc. of HSCC, 2013.

  • Nikolaj Bjorner, Krishnendu Chatterjee, Laura Kovacs, and Rupak M. Majumdar Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461). Dagstuhl Reports.

  • Krishnendu Chatterjee, Siddhesh Chaubal, and Sasha Rubin. How to travel between languages. Proc. of LATA, 2013.

  • Krishnendu Chatterjee and Laurent Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails. ACM ToCL.

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Polynomial-time Algorithms for Energy Games with Special Weight Structures. Algorithmica.

  • Benjamin M. Zagorsky, Johannes G. Reiter, Krishnendu Chatterjee, and Martin A. Nowak Forgiver triumphs in alternating Prisoner's Dilemma. PLoS ONE.

  • Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina K\"onighofer", and Robert K\"onighofer Synthesizing Robust Systems. Acta Informatica.

  • Krishnendu Chatterjee, Mickael Randour and Jean-Francois Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives. Acta Informatica.

  • Ivana Bozic, Johannes G. Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Sup Moon, Amin Yaqubie, Nicole Kelly, Dung T. Le, Evan J. Lipson, Paul B. Chapman, Luis A. Diaz Jr, Bert Vogelstein, and Martin A. Nowak. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife.

    Nature News and Views: NL Komarova, CR Boland. Cancer: Calculated treatment. Nature 499, 291-292 (2013).

    Press: New York Times, Nature Reviews Clinical Oncology, Boston Globe, Salzburger Nachrichten, science.orf.at, science.apa.at

  • Sebastian Novak, Krishnendu Chatterjee, and Martin A. Nowak. Density Games. Journal of Theoretical Biology (JTB).

  • Krishnendu Chatterjee and Vishwanath Raman. Assume-guarantee Synthesis for Digital Contract Signing. Formal Aspects of Computing (FAOC).

  • Krishnendu Chatterjee and Vinayak Prabhu. Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems. Information and Computation.

  • Tomas Brazdil, Vaclav Brozek, Krishnendu Chatterjee, Vojtech Forejt, and Antonin Kucera. Markov Decision Processes with Multiple Long-run Average Objectives. Logical Methods in Computer Science (LMCS).

  • Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar and Nisarg Shah. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\"uchi Objectives. Formal Methods in System Design (FMSD).

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. Strategy Improvement for Concurrent Reachability and Turn-based Stochastic Safety Games. Journal of Computer Systems and Sciences (JCSS).


2012

  • Krishnendu Chatterjee, Manas Joglekar and Nisarg Shah. Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B\"uchi Objectives. Proc. of FSTTCS, 2012.

  • Krishnendu Chatterjee, and Rasmus Ibsen-Jensen. Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. Proc. of MEMICS, 2012.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Vinayak Prabhu. Finite Automata with Time-Delay Blocks. Proc. of EMSOFT, 2012.

  • Krishnendu Chatterjee, Martin Chmelik and Rupak Majumdar. Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games. Proc. of ATVA, 2012.

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Polynomial-time Algorithms for Energy Games with Special Weight Structures. Proc. of ESA, 2012.

  • Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. Proc. of CSL, 2012.

  • Krishnendu Chatterjee, Mickael Randour and Jean-Francois Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives. Proc. of CONCUR, 2012.

  • Krishnendu Chatterjee and Laurent Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails. Proc. of LICS, 2012.

  • Krishnendu Chatterjee and Yaron Velner. Mean-Payoff Pushdown Games. Proc. of LICS, 2012.

  • Krishnendu Chatterjee and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. Proc. of LICS, 2012.

  • Tomas Brazdil, Krishnendu Chatterjee, Antonin Kucera and Petr Novotny. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Proc. of CAV, 2012.

  • Krishnendu Chatterjee. Robustness of Structurally Equivalent Concurrent Parity Games. Proc. of FOSSACS, 2012.

  • Krishnendu Chatterjee and Monika Henzinger. An O(n^2) Time Algorithm for Alternating B\"uchi Games. Proc. of SODA, 2012.

  • Krishnendu Chatterjee and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. Proc. of VMCAI, 2012.

  • Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games. Theoretical Computer Science (TCS).

  • Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar and Vishwanath Raman. Code Aware Resource Management. Formal Methods in System Design (FMSD).

  • Johannes Reiter, Ivana Bozic, Ben Allen, Krishnendu Chatterjee and Martin A. Nowak. The Effect of One Additional Driver Mutation on Tumor Progression. Journal of Evolutionary Applications.

  • Krishnendu Chatterjee, Luca de Alfaro and Rupak Majumdar. The Complexity of Coverage. International Journal of Foundations of Computer Science.

  • Krishnendu Chatterjee, Laurent Doyen and Thomas A. Henzinger. A Survey of Partial-Observation Stochastic Parity Games. Formal Methods in System Design (FMSD).

  • Krishnendu Chatterjee, Damien Zufferey and Martin A. Nowak. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology.

  • Krishnendu Chatterjee. The Complexity of Stochastic Muller Games. Information and Computation.

  • Krishnendu Chatterjee, Johannes G. Reiter and Martin A. Nowak. Evolutionary Dynamics of Biological Auctions. Journal of Theoretical Population Biology.


2011

  • Krishnendu Chatterjee and Rupak Majumdar. Minimum Attention Controller Synthesis for Omega-Regular Objectives. Proc. of FORMATS, 2011.

  • Krishnendu Chatterjee and Laurent Doyen. Games and Markov decision Processes with Mean-payoff Parity and Energy Parity Objectives. Proc. of MEMICS, 2011 (Invited paper).

  • Krishnendu Chatterjee, Laurent Doyen and Rohit Singh. On Memoryless Quantitative Objectives. Proc. of FCT, 2011.

  • Krishnendu Chatterjee and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Proc. of MFCS, 2011.

  • Krishnendu Chatterjee. Graph Games with Reachability Objectives. Proc. of Reachability Problems, 2011 (Invited Paper).

  • Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, and Barbara Jobstmann. Specification-Centered Robustness. Proc. of International Symposium on Industrial Embedded Systems, 2011 (Invited Paper).

  • Krishnendu Chatterjee and Nathanael Fijalkow. A reduction from parity games to simple stochastic games. Proc. of GANDALF, 2011.

  • Pavol Cerny, Krishnendu Chatterjee and Thomas A. Henzinger. The Complexity of Quantitative Information Flow. Proc. of CSF, 2011.

  • Pavol Cerny, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna and Rohit Singh. Quantitative Synthesis for Concurrent Programs. Proc. of CAV, 2011.

  • Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar and Nisarg Shah. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\"uchi Objectives. Proc. of CAV, 2011.

  • Tomas Brazdil, Vaclav Brozek, Krishnendu Chatterjee, Vojtech Forejt and Antonin Kucera. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. Proc. of LICS, 2011.

  • Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger and Orna kupferman. Temporal Specifications with Accumulative Values. Proc. of LICS, 2011.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Mathieu Tracol. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv Technical Report, 2011.

  • Krishnendu Chatterjee and Nathanael Fijalkow. Finitary Languages. Proc. of LATA, 2011.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Florian Horn. The Complexity of Request-response Games. Proc. of LATA, 2011.

  • Krishnendu Chatterjee and Vinayak Prabhu. Synthesis of Memory Efficient Real-Time Controllers for Safety Objectives. Proc. of HSCC, 2011.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann and Rohit Singh. QUASY: Quantitative Synthesis Tool. Proc. of TACAS, 2011.

  • Krishnendu Chatterjee and Monika Henzinger. Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification. Proc. of SODA, 2011.

  • Krishnendu Chatterjee and Rupak Majumdar. Discounting and Averaging in Games Across Time Scales. International Journal of Foundations of Computer Science, 2011.

  • Yashdeep Godhal, Krishnendu Chatterjee and Thomas A. Henzinger. Synthesis of AMBA AHB from Formal Specifications: A Case Study. Journal on Software Tools for Technology Transfer (STTT), 2011.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Vinayak Prabhu Timed Games: Complexity and Robustness. Logical Methods in Computer Science, 2011.

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. Qualitative Concurrent Parity Games. ACM ToCL, 2011.

  • Krishnendu Chatterjee and Thomas A. Henzinger. A Survey of Stochastic Omega-Regular Games. JCSS 2012 (Accepted 2007).


2010

  • Krishnendu Chatterjee, Luca de Alfaro, Vishwanath Raman, and Cesar Sanchez. Analyzing the Impact of Change in Multi-threaded Programs. Proc. of FASE, 2010.

  • Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, and Barbara Jobstmann. Robustness in the presence of liveness. Proc. of CAV, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, and Rohit Singh. Measuring and Synthesizing Systems in Probabilistic Environments. Proc. of CAV, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. GIST A solver for Probabilistic Games (Tool Paper). Proc. of CAV, 2010.

  • Krishnendu Chatterjee and Laurent Doyen. Energy-parity Games. Proc. of ICALP(2), 2010.

  • Krishnendu Chatterjee and Rupak Majumdar. Discounting in games across time scales. Proc. of GandALF, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, and Thomas A. Henzinger. Randomness for Free. Proc. of MFCS, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Qualitative Analysis of Partially-observable Markov Decision Processes. Proc. of MFCS, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, and Phillipe Rannou. Mean-payoff Automaton Expressions. Proc. of CONCUR, 2010.

  • Krishnendu Chatterjee, Florian Horn, and Christof Loeding. Obligingness Games. Proc. of CONCUR, 2010.

  • Krishnendu Chatterjee and Thomas A. Henzinger (volumer editors). FORMATS 2010.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Probabilistic automata on infinite words: Decidability and undecidability results. Proc. of ATVA, 2010.

  • Krishnendu Chatterjee and Laurent Doyen. The Complexity of Partial-observation Parity Games. Proc. of LPAR, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger and Jean-Francois Raskin. Generalized Mean-payoff and Energy Games Proc. of FSTTCS, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Expressiveness and Closure Properties For Quantitative Languages. Logical Methods in Computer Science, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative Languages. ACM ToCL, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy Logic. Information and Computation, 2010.

  • Dietmar Berwagner, Krishnendu Chatterjee, Martin de Wulf, Laurent Doyen and Thomas A. Henzinger. Strategy Construction for Parity Games with Imperfect information. Information and Computation, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Finitary Winning \omega-Regular Games. ACM ToCL, 2010.


2009

  • Dietmar Berwagner, Krishnendu Chatterjee, Martin de Wulf, Laurent Doyen, and Thomas A. Henzinger. ALPAGA: A Tool for Solving Parity Games with Imperfect Information (Tool Paper). Proc. of TACAS, 2009.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Probabilistic Systems with LimSup and LimInf Objective. Proc. of ILC, 2009

  • Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. Termination Criteria for Solving Concurrent Safety and Reachability Games. [ERRATA] Proc. of SODA, 2009. There is a gap in the proof of Theorem 4.3 of the conference version. See the following link for the fuller version combined with results of QEST 2006 paper on concurrent reachability games, where a modified algorithm proves the equivalent of Theorem 4.3 of the conference version. Link of Combined Paper

  • Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, and Barbara Jobstmann. Better Quality in Synthesis through Quantitative Objectives. Proc. of CAV, 2009

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Probabilistic Weighted Automata. Proc. of CONCUR, 2009

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Alternating Weighted Automata. Proc. of FCT, 2009

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. A Survey of Stochastic Games with Limsup and Liminf Objectives. Proc. of ICALP(2), 2009

  • Krishnendu Chatterjee and Thomas A. Henzinger. Value Iteration. 25 Years in Model Checking.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Stochastic Games with Finitary Objectives. Proc. of MFCS, 2009.

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger Expressiveness and Closure Properties For Quantitative Languages Proc. of LICS, 2009.

  • Krishnendu Chatterjee, Rupak Majumdar, and Thomas A. Henzinger. Stochastic Limit Average Games are in EXPTIME. International Journal of Game Theory, 2009

  • Krishnendu Chatterjee, Luca de Alfaro Marco Faella and Axel Legay. Qualitative Logics and Equivalences for Probabilistic Systems. Logical Methods in Computer Science, 2009.


2008

  • Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar and Vishwanath Raman. Algorithms for Game Metrics. Proc. of FSTTCS, 2008.

  • Krishnendu Chatterjee, Luca de Alfaro and Rupak Majumdar. The Complexity of Coverage. Proc. of APLAS, 2008.

  • Krishnendu Chatterjee, Luca de Alfaro and Ian Pye. Robust Content Driven Reputation. Proc. of AiSec, 2008.

  • Bo Adler, Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Ian Pye and Vishwanath Raman. Assigning Trust to Wikipedia Content. Proc. of WikiSym, 2008.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Vinayak Prabhu. Timed Games: Complexity and Robustness. Proc. of FORMATS, 2008.

  • Krishnendu Chatterjee, Laurent Doyen and Thomas A. Henzinger. Quantitative Languages. Proc. of CSL, 2008.

  • Dietmar Berwagner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger and Sangram Raje. Strategy Construction for Parity Games with Imperfect Information. Proc. of CONCUR, 2008.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Barbara Jobstmann. Environment Assumptions for Synthesis. Proc. of CONCUR, 2008.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Vinayak Prabhu. Trading Infinite Memory for Uniform Randomness in Timed Games. Proc. of HSCC, 2008.

  • Krishnendu Chatterjee, Rupak Majumdar and Thomas A. Henzinger. Controller Synthesis with Budget Constraints. Proc. of HSCC, 2008.

  • Krishnendu Chatterjee, Arkadeb Ghoshal, Thomas A. Henzinger, Daniel Irkan, Christoph Kirsch, Claudio Pinello and Alberto Sangiovanni Vincentelli. Reliability of Interacting Real-time Tasks. Proc. of DATE, 2008.

  • Krishnendu Chatterjee, Koushik Sen and Thomas A. Henzinger. Model Checking omega-Regular Properties of Interval Markov Chains. Proc. of FoSSaCS, 2008.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 2008

  • Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, and Vishwanath Raman. Algorithms for Game Metrics. Logical Methods in Computer Science, 2008.


2007

  • Krishnendu Chatterjee. Thesis: Stochastic \omega-Regular Games [PhD Thesis]

  • Krishnendu Chatterjee. Stochastic Muller Games are PSPACE-complete. Proc. of FSTTCS, 2007.

  • Krishnendu Chatterjee. Markov Decision Processes with Multilple Long-run Average Objectives. Proc. of FSTTCS, 2007.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Nir Piterman. Strategy Logic. Proc. of CONCUR, 2007.

  • Luca de Alfaro, Krishnendu Chatterjee, Marco Faella and Axel Legay. Qualitative Logics and Equivalences for Probabilistic Systems. Proc. of QEST, 2007.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Assume-Guarantee Synthesis. Proc. of TACAS, 2007.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Nir Piterman. Generalized Parity Games. Proc. of FoSSaCS, 2007.

  • Krishnendu Chatterjee. Optimal Strategy Synthesis for Stochastic Muller Games. Proc. of FoSSaCS, 2007.

  • Krishnendu Chatterjee. Concurrent Games with Tail Objectives. Theoretical Computer Science, 2007

  • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-Francois Raskin. Algorithms for Omega-Regular Games with Imperfect Information Logical Methods in Computer Science, 2007


2006

  • Krishnendu Chatterjee, Thomas A. Henzinger and Nir Piterman. Algorithms for Buchi Games. Games for Design and Verification (GDV), 2006.

  • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger and Jean-Francois Raskin. Algorithms for Omega-Regular Games with Imperfect Information. Proc. of Computer Science Logic (CSL), 2006.

  • Krishnendu Chatterjee. Nash Equilibrium for Upward-Closed Objectives. Proc. of Computer Science Logic (CSL), 2006.

  • Krishnendu Chatterjee. Concurrent Games with Tail Objectives. Proc. of Computer Science Logic (CSL), 2006.

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. Strategy Improvement for Concurrent Reachability Games. Proc. of QEST, 2006.

  • Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar and Marielle Stoelinga. Quantitative Compositional Pricing. Proc. of QEST, 2006.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Strategy Improvement for Stochastic Rabin and Streett Games. Proc. of CONCUR, 2006.

  • Krishnendu Chatterjee, Radha Jagadeesan and Corin Pitcher. Games for Controls. Proc. of Computer Security Foundations Workshop (CSFW), 2006.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Finitary Winning in \omega-Regular Games. Proc. of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2006.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. Proc. of Symposium on Theoretical Aspects of Computer Science (STACS), 2006.

  • Krishnendu Chatterjee, Rupak Majumdar and Thomas A. Henzinger. Markov Decision Processes with Multiple Objectives. Proc. of Symposium on Theoretical Aspects of Computer Science (STACS), 2006.

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. The Complexity of Quantitative Concurrent Parity Games. Proc. of Symposium on Discrete Algorithms (SODA), 2006.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Games with Secure Equilibria Theoretical Computer Science, 2006


2005

  • Krishnendu Chatterjee and Thomas A. Henzinger. Semiperfect-Information Games. Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2005.

  • Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman and Rupak Majumdar. Verifying Quantitative Properties Using Bound Functions. Proc. of Correct Hardware Design and Verification Methods (CHARME), 2005.

  • Krishnendu Chatterjee. Two-player Nonzero-sum \omega-regular Games. Proc. of Concurrency Theory (CONCUR), 2005.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala and Rupak Majumdar. Counter-example Guided Planning. Proc. of Uncertainty in Artificial Intelligence (UAI), 2005.

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. The Complexity of Stochastic Rabin and Streett Games. Proc. of International Colloquim on Automata, Languages and Programming (ICALP), 2005.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski. Mean-Payoff Parity Games. Proc. of Logic in Computer Science (LICS), 2005.


2004

  • Krishnendu Chatterjee, Luca de Alfaro, and Thomas A. Henzinger. Trading memory for randomness. Proc. of Quantitative Evaluation of Systems (QEST), 2004.

  • Krishnendu Chatterjee, Marcin Jurdzinski and Rupak Majumdar. On Nash Equilibria in Stochastic Games. [ERRATA] Proc. of Computer Science Logic (CSL), 2004. [There are some flaws in the paper. See errata for the flaws and the consequences]

  • Krishnendu Chatterjee, Thomas A. Henzinger and Marcin Jurdzinski. Games with Secure Equilibria. Proc. of Logic in Computer Science (LICS), 2004.

  • Krishnendu Chatterjee, Marcin Jurdzinski and Thomas A. Henzinger. Quantitative Stochastic Parity Games. Proc. of Symposium on Discrete Algorithms (SODA), 2004.

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures. Prof. of IWDC, 2004.

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. The Power of First Order Quantification over States in Branching and Linear Time Temporal Logics. Information Processing Letters, 2004

  • Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, and Jens Palsberg. Stack Size Analysis of Interrupt Driven Programs. Information and Computation, 2004


2003 and Before

  • Krishnendu Chatterjee, Marcin Jurdzinski and Thomas A. Henzinger. Simple Stochastic Parity Games. Proc. of Computer Science Logic (CSL), 2003.

  • Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger and Jens Palsberg. Stack Size Analysis of Interrupt Driven Programs. Proc. of Static Analysis Symposium (SAS), 2003.

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. Weighted Quantified Computation Tree Logic. Proc. of Conference on Information Technology (CIT), 2002.

  • Sanhita Mallick, Krishnendu Chatterjee, Arif N. Merchant and Pallab Dasgupta. Implementation of Shape Grammar for Plan Analysis. Proc. of IT-Built, 2002.

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. A Branching Time Temporal Framework for Quantitative Reasoning. Journal of Automated Reasoning, 2003


Journals

  • Maria Svorenova, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerna, and Calin Belta. Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. Nonlinear Analysis: Hybrid Systems.

  • Krishnendu Chatterjee, Martin Chmelik and Mathieu Tracol. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. JCSS.

  • Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta and Ayush Kanodia. Optimal Cost Almost-sure Reachability in POMDPs. AI Journal.

  • Rasmus Ibsen-Jensen, Krishnendu Chatterjee and Martin A. Nowak. The computational complexity of ecological and evolutionary spatial dynamics. PNAS.

  • Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot and Jean-Francois Raskin. Doomsday Equilibria for Omega-Regular Games. Information and Computation.

  • Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop and Yaron Velner. Quantitative Fair Simulation Games. Information and Computation.

  • Andreas Pavlogiannis, Krishnendu Chatterjee, Ben Adlam and Martin A. Nowak. Cellular cooperation with shift updating and repulsion. Nature Scientific Reports

  • Tadeas Priklopil and Krishnendu Chatterjee. Evolution of decisions in population games with sequentially searching individuals. GAMES.

  • Krishnendu Chatterjee, Martin Chmelik and Przemyslaw Daca. CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes. FMSD (Formal Methods in Systems Design).

  • Ben Adlam, Krishnendu Chatterjee, and Martin A. Nowak. Amplifiers of Selection. Proceedings of the Royal Society A (Proc R Soc A).

  • Krishnendu Chatterjee and Vinayak P. Prabhu. Quantitative Temporal Simulation and Refinement Distances for Timed Systems. IEEE Trans. on Automatic Control (TACON).

  • Johannes Reiter, Ayush Kanodia, Raghav Gupta, Martin A. Nowak and Krishnendu Chatterjee. Biological Auctions with Multiple Rewards. Proceedings of the Royal Society B (Proc R Soc B).

  • Krishnendu Chatterjee, Manas Joglekar and Nisarg Shah. Average Case Analysis of the Classical Algorithm for Markov Decision Processes with B\"uchi Objectives. Theoretical Computer Science (TCS).

  • Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, and Rohit Singh. Measuring and Synthesizing Systems in Probabilistic Environments. JACM.

  • Makohon-Moore, A., Zhang, M., Reiter, J. G., Bozic, I., Wong, F., Jiao, Y., Chatterjee, K., Nowak, M. A., Papadopoulos, N., Vogelstein, B., Kinzler, K.W., Iacobuzio- Donahue, C. A. Clonal evolution defines the natural history of metastatic pancreatic cancer. Journal of Cancer Research

  • Krishnendu Chatterjee and Martin Chmelik. POMDPs under Probablistic Semantics. AI Journal.

  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert and Thomas A. Henzinger. Randomness for Free Information and Computation.

  • Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and Jean-Francois Raskin. The Complexity of Multi-Mean-Payoff and Multi-Energy Games Information and Computation.

  • Beatrice Berard, Krishnendu Chatterjee and Nathalie Sznajder. Probabilistic Opacity for Markov Decision Processes. IPL (Information Processing Letters).

  • Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam and Martin A. Nowak. The Time Scale of Evolutionary Innovation PLOS Computational Biology

  • Krishnendu Chatterjee and Jiri Sgall (volumer editors). Information and Computation Speical Issue of MFCS 2013.

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. Approximating the minimum cycle mean Theoretical Computer Science.

  • Krishnendu Chatterjee and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-payoff Games Information and Computation.

  • Krishnendu Chatterjee, Laurent Doyen, Mickael Randour and Jean-Francois Raskin. Looking at Mean-Payoff and Total-Payoff through Windows Information and Computation.

  • Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger and Orna kupferman. Temporal Specifications with Accumulative Values ACM ToCL.

  • Krishnendu Chatterjee and Monika Henzinger. Efficient and Dynamic Algorithms for Alternating B\"uchi Games and Maximal End-component Decomposition JACM.

  • Krishnendu Chatterjee and Laurent Doyen. Partial-Observation Stochastic Games: How to Win when Belief Fails ACM ToCL.

  • Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger and Danupon Nanongkai. Polynomial-time Algorithms for Energy Games with Special Weight Structures Algorithmica.

  • Benjamin M. Zagorsky, Johannes G. Reiter, Krishnendu Chatterjee, and Martin A. Nowak Forgiver triumphs in alternating Prisoner's Dilemma PLoS ONE.

  • Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina K\"onighofer", and Robert K\"onighofer Synthesizing Robust Systems Acta Informatica.

  • Krishnendu Chatterjee, Mickael Randour and Jean-Francois Raskin. Strategy Synthesis for Multi-dimensional Quantitative Objectives Acta Informatica.

  • Ivana Bozic, Johannes G. Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Sup Moon, Amin Yaqubie, Nicole Kelly, Dung T. Le, Evan J. Lipson, Paul B. Chapman, Luis A. Diaz Jr, Bert Vogelstein, and Martin A. Nowak Evolutionary dynamics of cancer in response to targeted combination therapy eLife.

  • Sebastian Novak, Krishnendu Chatterjee, and Martin A. Nowak. Density Games Journal of Theoretical Biology (JTB).

  • Krishnendu Chatterjee and Vishwanath Raman. Assume-guarantee Synthesis for Digital Contract Signing. Formal Aspects of Computing (FAOC).

  • Krishnendu Chatterjee and Vinayak Prabhu. Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems Information and Computation.

  • Tomas Brazdil, Vaclav Brozek, Krishnendu Chatterjee, Vojtech Forejt, and Antonin Kucera. Markov Decision Processes with Multiple Long-run Average Objectives Logical Methods in Computer Science (LMCS).

  • Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar and Nisarg Shah. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with B\"uchi Objectives Formal Methods in System Design (FMSD).

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. Strategy Improvement for Concurrent Reachability and Turn-based Stochastic Safety Games. Journal of Computer Systems and Sciences (JCSS).

  • Krishnendu Chatterjee and Laurent Doyen. Energy Parity Games Theoretical Computer Science (TCS).

  • Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar and Vishwanath Raman. Code Aware Resource Management Formal Methods in System Design (FMSD).

  • Johannes Reiter, Ivana Bozic, Ben Allen, Krishnendu Chatterjee and Martin A. Nowak. The Effect of One Additional Driver Mutation on Tumor Progression Journal of Evolutionary Applications.

  • Krishnendu Chatterjee, Luca de Alfaro and Rupak Majumdar. The Complexity of Coverage International Journal of Foundations of Computer Science.

  • Krishnendu Chatterjee, Laurent Doyen and Thomas A. Henzinger. A Survey of Partial-Observation Stochastic Parity Games Formal Methods in System Design (FMSD).

  • Krishnendu Chatterjee, Damien Zufferey and Martin A. Nowak. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology.

  • Krishnendu Chatterjee. The Complexity of Stochastic Muller Games. Information and Computation.

  • Krishnendu Chatterjee, Johannes G. Reiter and Martin A. Nowak. Evolutionary Dynamics of Biological Auctions Journal of Theoretical Population Biology.

  • Krishnendu Chatterjee and Rupak Majumdar. Discounting and Averaging in Games Across Time Scales International Journal of Foundations of Computer Science, 2011.

  • Yashdeep Godhal, Krishnendu Chatterjee and Thomas A. Henzinger. Synthesis of AMBA AHB from Formal Specifications: A Case Study Journal on Software Tools for Technology Transfer (STTT), 2011.

  • Krishnendu Chatterjee, Thomas A. Henzinger and Vinayak Prabhu Timed Games: Complexity and Robustness Logical Methods in Computer Science, 2011.

  • Krishnendu Chatterjee, Luca de Alfaro and Thomas A. Henzinger. Qualitative Concurrent Parity Games ACM ToCL, 2011.

  • Krishnendu Chatterjee and Thomas A. Henzinger. A Survey of Stochastic Omega-Regular Games. JCSS 2011 (Accepted 2007).

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Expressiveness and Closure Properties For Quantitative Languages. Logical Methods in Computer Science, 2010.

  • Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Quantitative Languages. ACM ToCL, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Strategy Logic. Information and Computation, 2010.

  • Dietmar Berwagner, Krishnendu Chatterjee, Martin de Wulf, Laurent Doyen and Thomas A. Henzinger. Strategy Construction for Parity Games with Imperfect information. Information and Computation, 2010.

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Florian Horn. Finitary Winning \omega-Regular Games. ACM ToCL, 2010.

  • Krishnendu Chatterjee, Rupak Majumdar, and Thomas A. Henzinger. Stochastic Limit Average Games are in EXPTIME. International Journal of Game Theory, 2008

  • Krishnendu Chatterjee, Luca de Alfaro Marco Faella and Axel Legay. Qualitative Logics and Equivalences for Probabilistic Systems. Logical Methods in Computer Science, 2009.

  • Krishnendu Chatterjee and Thomas A. Henzinger. Reduction of stochastic parity to stochastic mean-payoff games. Information Processing Letters, 2008

  • Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, and Vishwanath Raman. Algorithms for Game Metrics. Logical Methods in Computer Science, 2008.

  • Krishnendu Chatterjee. Concurrent Games with Tail Objectives. Theoretical Computer Science, 2007

  • Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-Francois Raskin. Algorithms for Omega-Regular Games with Imperfect Information Logical Methods in Computer Science, 2007

  • Krishnendu Chatterjee, Thomas A. Henzinger, and Marcin Jurdzinski. Games with Secure Equilibria Theoretical Computer Science, 2006

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. The Power of First Order Quantification over States in Branching and Linear Time Temporal Logics. Information Processing Letters, 2004

  • Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, and Jens Palsberg. Stack Size Analysis of Interrupt Driven Programs. Information and Computation, 2004

  • Krishnendu Chatterjee, Pallab Dasgupta and P.P. Chakrabarti. A Branching Time Temporal Framework for Quantitative Reasoning. Journal of Automated Reasoning, 2003


Selected Publications of Group Members

  • M. Milinski, C. Hilbe, D. Semman, R. Sommerfeld, J. Marotzke. Humans choose representatives who enforce cooperation in social dilemmas through extortion. Nature Communications 7, 10915, 2016. (Group Member Christian Hilbe, Postdoc)

  • K. Lohse, M. Chmelik, S. H. Martin, and N. H. Barton. Efficient Strategies for Calculating Blockwise Likelihoods under the Coalescent. Genetics 2016. (Group Member Martin Chmelik, PhD Student)

  • DA Landau, E Tausch, AN Taylor-Weiner, C Stewart, JG Reiter, J Bahlo, S Kluth, I Bozic, M Lawrence, S Bottcher, SL Carter, K Cibulskis, D Mertens, C Sougnez, M Rosenberg, JM Hess, J Edelmann, S Kless, M Kneba, M Ritgen, A Fink, K Fischer, S Gabriel, ES Lander, MA Nowak, H Dohner, M Hallek, D Neuberg, G Getz, S Stilgenbauer, CJ Wu. Mutations driving CLL and their evolution in progression and relapse. Nature 526, 525-530 (2015). (Group Member Johannes Reiter, PhD Student)

  • P. Cerny, M. Chmelik, T. Henzinger, A. Radhakrishna. Interface simulation distances. TCS 2014. (Group Member Martin Chmelik, PhD Student)

  • LA Diaz Jr, R Williams, J Wu, I Kinde, JR Hecht, J Berlin, B Allen, I Bozic, JG Reiter, MA Nowak, KW Kinzler, KS Oliner, B Vogelstein. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature 486, 537-540 (2012). (Group Member Johannes Reiter, PhD Student)

  • Alexander Rabinovich and Sasha Rubin. LICS 2012. (Group Member Sasha Rubin, PostDoc)


Last updated in July 2014.