Simple Stochastic Parity Games. - Krishnendu Chatterjee; Marcin Jurdzinski; Thomas A. Henzinger (CSL, 2003)

A Branching Time Temporal Framework for Quantitative Reasoning. - Krishnendu Chatterjee; Pallab Dasgupta; P. P. Chakrabarti 001 (J. Autom. Reason., 2003)

On Nash Equilibria in Stochastic Games. - Krishnendu Chatterjee; Rupak Majumdar; Marcin Jurdzinski (CSL, 2004)

Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures. - Krishnendu Chatterjee; Pallab Dasgupta; P. P. Chakrabarti 001 (IWDC, 2004)

Trading Memory for Randomness. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (QEST, 2004)

Quantitative stochastic parity games. - Krishnendu Chatterjee; Marcin Jurdzinski; Thomas A. Henzinger (SODA, 2004)

Stack size analysis for interrupt-driven programs. - Krishnendu Chatterjee; Di Ma; Rupak Majumdar; Tian Zhao 002; Thomas A. Henzinger; Jens Palsberg (Inf. Comput., 2004)

The power of first-order quantification over states in branching and linear time temporal logics. - Krishnendu Chatterjee; Pallab Dasgupta; P. P. Chakrabarti 001 (Inf. Process. Lett., 2004)

Verifying Quantitative Properties Using Bound Functions. - Arindam Chakrabarti; Krishnendu Chatterjee; Thomas A. Henzinger; Orna Kupferman; Rupak Majumdar (CHARME, 2005)

Two-Player Nonzero-Sum omega-Regular Games. - Krishnendu Chatterjee (CONCUR, 2005)

Semiperfect-Information Games. - Krishnendu Chatterjee; Thomas A. Henzinger (FSTTCS, 2005)

The Complexity of Stochastic Rabin and Streett Games'. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (ICALP, 2005)

Mean-Payoff Parity Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Marcin Jurdzinski (LICS, 2005)

Counterexample-guided Planning. - Krishnendu Chatterjee; Thomas A. Henzinger; Ranjit Jhala; Rupak Majumdar (UAI, 2005)

Strategy Improvement for Stochastic Rabin and Streett Games. - Krishnendu Chatterjee; Thomas A. Henzinger (CONCUR, 2006)

Games for Controls. - Krishnendu Chatterjee; Radha Jagadeesan; Corin Pitcher (CSFW, 2006)

Nash Equilibrium for Upward-Closed Objectives. - Krishnendu Chatterjee (CSL, 2006)

Algorithms for Omega-Regular Games with Imperfect Information, . - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (CSL, 2006)

Compositional Quantitative Reasoning. - Krishnendu Chatterjee; Luca de Alfaro; Marco Faella; Thomas A. Henzinger; Rupak Majumdar; Mariëlle Stoelinga (QEST, 2006)

Strategy Improvement for Concurrent Reachability Games. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (QEST, 2006)

The complexity of quantitative concurrent parity games. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (SODA, 2006)

Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. - Krishnendu Chatterjee; Thomas A. Henzinger (STACS, 2006)

Markov Decision Processes with Multiple Objectives. - Krishnendu Chatterjee; Rupak Majumdar; Thomas A. Henzinger (STACS, 2006)

Finitary Winning in omega-Regular Games. - Krishnendu Chatterjee; Thomas A. Henzinger (TACAS, 2006)

Games with secure equilibria. - Krishnendu Chatterjee; Thomas A. Henzinger; Marcin Jurdzinski (Theor. Comput. Sci., 2006)

Optimal Strategy Synthesis in Stochastic Müller Games. - Krishnendu Chatterjee (FoSSaCS, 2007)

Generalized Parity Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Nir Piterman (FoSSaCS, 2007)

Stochastic Müller Games are PSPACE-Complete. - Krishnendu Chatterjee (FSTTCS, 2007)

Markov Decision Processes with Multiple Long-Run Average Objectives. - Krishnendu Chatterjee (FSTTCS, 2007)

Probabilistic Systems with LimSup and LimInf Objectives. - Krishnendu Chatterjee; Thomas A. Henzinger (ILC, 2007)

Assume-Guarantee Synthesis. - Krishnendu Chatterjee; Thomas A. Henzinger (TACAS, 2007)

Algorithms for Omega-Regular Games with Imperfect Information. - Jean-François Raskin; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Log. Methods Comput. Sci., 2007)

Concurrent games with tail objectives. - Krishnendu Chatterjee (Theor. Comput. Sci., 2007)

Robust content-driven reputation. - Krishnendu Chatterjee; Luca de Alfaro; Ian Pye (AISec, 2008)

Strategy Construction for Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Sangram Raje (CONCUR, 2008)

Environment Assumptions for Synthesis. - Krishnendu Chatterjee; Thomas A. Henzinger; Barbara Jobstmann (CONCUR, 2008)

Logical Reliability of Interacting Real-Time Tasks. - Krishnendu Chatterjee; Arkadeb Ghosal; Thomas A. Henzinger; Daniel T. Iercan; Christoph M. Kirsch; Claudio Pinello; Alberto L. Sangiovanni-Vincentelli (DATE, 2008)

Model-Checking omega-Regular Properties of Interval Markov Chains. - Krishnendu Chatterjee; Koushik Sen; Thomas A. Henzinger (FoSSaCS, 2008)

Algorithms for Game Metrics. - Krishnendu Chatterjee; Luca de Alfaro; Rupak Majumdar; Vishwanath Raman (FSTTCS, 2008)

Trading Infinite Memory for Uniform Randomness in Timed Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Vinayak S. Prabhu (HSCC, 2008)

Controller Synthesis with Budget Constraints. - Krishnendu Chatterjee; Rupak Majumdar; Thomas A. Henzinger (HSCC, 2008)

Value Iteration. - Krishnendu Chatterjee; Thomas A. Henzinger (25 Years of Model Checking, 2008)

Assigning trust to Wikipedia content. - B. Thomas Adler; Krishnendu Chatterjee; Luca de Alfaro; Marco Faella; Ian Pye; Vishwanath Raman (Int. Sym. Wikis, 2008)

Strategy Improvement for Concurrent Safety Games - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (CoRR, 2008)

Linear Time Algorithm for Weak Parity Games - Krishnendu Chatterjee (CoRR, 2008)

Algorithms for Büchi Games - Krishnendu Chatterjee; Thomas A. Henzinger; Nir Piterman (CoRR, 2008)

Stochastic limit-average games are in EXPTIME. - Krishnendu Chatterjee; Rupak Majumdar; Thomas A. Henzinger (Int. J. Game Theory, 2008)

Reduction of stochastic parity to stochastic mean-payoff games. - Krishnendu Chatterjee; Thomas A. Henzinger (Inf. Process. Lett., 2008)

Better Quality in Synthesis through Quantitative Objectives. - Roderick Bloem; Krishnendu Chatterjee; Thomas A. Henzinger; Barbara Jobstmann (CAV, 2009)

Probabilistic Weighted Automata. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (CONCUR, 2009)

Alternating Weighted Automata. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (FCT, 2009)

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

Stochastic Games with Finitary Objectives. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (MFCS, 2009)

Termination criteria for solving concurrent safety and reachability games. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (SODA, 2009)

Alpaga: A Tool for Solving Parity Games with Imperfect Information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (TACAS, 2009)

Qualitative Logics and Equivalences for Probabilistic Systems - Krishnendu Chatterjee; Luca de Alfaro; Marco Faella; Axel Legay (Log. Methods Comput. Sci., 2009)

Finitary winning in omega-regular games. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (ACM Trans. Comput. Log., 2009)

Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. - Krishnendu Chatterjee; Thomas A. Henzinger (ATVA, 2010)

Robustness in the Presence of Liveness. - Roderick Bloem; Krishnendu Chatterjee; Karin Greimel; Thomas A. Henzinger; Barbara Jobstmann (CAV, 2010)

Gist: A Solver for Probabilistic Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Barbara Jobstmann; Arjun Radhakrishna (CAV, 2010)

Mean-Payoff Automaton Expressions. - Krishnendu Chatterjee; Laurent Doyen 001; Herbert Edelsbrunner; Thomas A. Henzinger; Philippe Rannou (CONCUR, 2010)

Obliging Games. - Krishnendu Chatterjee; Florian Horn 001; Christof Löding (CONCUR, 2010)

Analyzing the Impact of Change in Multi-threaded Programs. - Krishnendu Chatterjee; Luca de Alfaro; Vishwanath Raman; César Sánchez 001 (FASE, 2010)

Generalized Mean-payoff and Energy Games. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Jean-François Raskin (FSTTCS, 2010)

The Complexity of Partial-Observation Parity Games. - Krishnendu Chatterjee; Laurent Doyen 001 (LPAR (Yogyakarta), 2010)

Qualitative Analysis of Partially-Observable Markov Decision Processes. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (MFCS, 2010)

Algorithms for Game Metrics (Full Version) - Krishnendu Chatterjee; Luca de Alfaro; Rupak Majumdar; Vishwanath Raman (Log. Methods Comput. Sci., 2010)

Synthesis of AMBA AHB from Formal Specification - Yashdeep Godhal; Krishnendu Chatterjee; Thomas A. Henzinger (CoRR, 2010)

Discounting in Games across Time Scales - Krishnendu Chatterjee; Rupak Majumdar (GANDALF, 2010)

Expressiveness and Closure Properties for Quantitative Languages - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Log. Methods Comput. Sci., 2010)

Strategy construction for parity games with imperfect information. - Dietmar Berwanger; Krishnendu Chatterjee; Martin De Wulf; Laurent Doyen 001; Thomas A. Henzinger (Inf. Comput., 2010)

Strategy logic. - Krishnendu Chatterjee; Thomas A. Henzinger; Nir Piterman (Inf. Comput., 2010)

Quantitative languages. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (ACM Trans. Comput. Log., 2010)

Quantitative Synthesis for Concurrent Programs. - Pavol Cerný; Krishnendu Chatterjee; Thomas A. Henzinger; Arjun Radhakrishna; Rohit Singh 002 (CAV, 2011)

The Complexity of Quantitative Information Flow Problems. - Pavol Cerný; Krishnendu Chatterjee; Thomas A. Henzinger (CSF, 2011)

On Memoryless Quantitative Objectives. - Krishnendu Chatterjee; Laurent Doyen 001; Rohit Singh 002 (FCT, 2011)

Minimum Attention Controller Synthesis for Omega-Regular Objectives. - Krishnendu Chatterjee; Rupak Majumdar (FORMATS, 2011)

Synthesis of memory-efficient "real-time" controllers for safety objectives. - Krishnendu Chatterjee; Vinayak S. Prabhu (HSCC, 2011)

Finitary Languages. - Krishnendu Chatterjee; Nathanaël Fijalkow (LATA, 2011)

The Complexity of Request-Response Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (LATA, 2011)

Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives. - Krishnendu Chatterjee; Laurent Doyen 001 (MEMICS, 2011)

Energy and Mean-Payoff Parity Markov Decision Processes. - Krishnendu Chatterjee; Laurent Doyen 001 (MFCS, 2011)

Graph Games with Reachability Objectives - (Invited Talk). - Krishnendu Chatterjee (RP, 2011)

Specification-centered robustness. - Roderick Bloem; Krishnendu Chatterjee; Karin Greimel; Thomas A. Henzinger; Barbara Jobstmann (SIES, 2011)

Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. - Krishnendu Chatterjee; Monika Henzinger (SODA, 2011)

QUASY: Quantitative Synthesis Tool. - Krishnendu Chatterjee; Thomas A. Henzinger; Barbara Jobstmann; Rohit Singh 002 (TACAS, 2011)

Timed Parity Games: Complexity and Robustness - Krishnendu Chatterjee; Thomas A. Henzinger; Vinayak S. Prabhu (Log. Methods Comput. Sci., 2011)

Synthesis of Memory-Efficient Real-Time Controllers for Safety Objectives (Full Version) - Krishnendu Chatterjee; Vinayak S. Prabhu (CoRR, 2011)

The Decidability Frontier for Probabilistic Automata on Infinite Words - Krishnendu Chatterjee; Thomas A. Henzinger; Mathieu Tracol (CoRR, 2011)

A reduction from parity games to simple stochastic games - Krishnendu Chatterjee; Nathanaël Fijalkow (GandALF, 2011)

Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-run Average Objectives - Krishnendu Chatterjee; Luca de Alfaro; Pritam Roy (CoRR, 2011)

Bounded Rationality in Concurrent Parity Games - Krishnendu Chatterjee (CoRR, 2011)

An O(n^2) Time Algorithm for Alternating Büchi Games - Krishnendu Chatterjee; Monika Henzinger (CoRR, 2011)

Qualitative concurrent parity games. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (ACM Trans. Comput. Log., 2011)

Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. - Krishnendu Chatterjee; Martin Chmelik; Rupak Majumdar (ATVA, 2012)

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. - Tomás Brázdil; Krishnendu Chatterjee; Antonín Kucera 001; Petr Novotný 001 (CAV, 2012)

Faster Algorithms for Alternating Refinement Relations. - Krishnendu Chatterjee; Siddhesh Chaubal; Pritish Kamath (CSL, 2012)

Finite automata with time-delay blocks. - Krishnendu Chatterjee; Thomas A. Henzinger; Vinayak S. Prabhu (EMSOFT, 2012)

Robustness of Structurally Equivalent Concurrent Parity Games. - Krishnendu Chatterjee (FoSSaCS, 2012)

Decidable Problems for Probabilistic Automata on Infinite Words. - Krishnendu Chatterjee; Mathieu Tracol (LICS, 2012)

Mean-Payoff Pushdown Games. - Krishnendu Chatterjee; Yaron Velner (LICS, 2012)

Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (MEMICS, 2012)

An O(n2) time algorithm for alternating Büchi games. - Krishnendu Chatterjee; Monika Henzinger (SODA, 2012)

Synthesizing Protocols for Digital Contract Signing. - Krishnendu Chatterjee; Vishwanath Raman (VMCAI, 2012)

Strategy Improvement for Concurrent Reachability and Safety Games - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (CoRR, 2012)

Finite Automata with Time-Delay Blocks (Extended Version) - Krishnendu Chatterjee; Thomas A. Henzinger; Vinayak S. Prabhu (CoRR, 2012)

Finite-State and Pushdown Games with Multi-dimensional Mean-Payoff Objectives - Krishnendu Chatterjee; Yaron Velner (CoRR, 2012)

Quantitative Timed Simulation Functions and Refinement Metrics for Timed Systems (Full Version) - Krishnendu Chatterjee; Vinayak S. Prabhu (CoRR, 2012)

Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461). - Nikolaj S. Bjørner; Krishnendu Chatterjee; Laura Kovács; Rupak Majumdar (Dagstuhl Reports, 2012)

The complexity of stochastic Müller games. - Krishnendu Chatterjee (Inf. Comput., 2012)

Discounting and Averaging in Games across Time scales. - Krishnendu Chatterjee; Rupak Majumdar (Int. J. Found. Comput. Sci., 2012)

A survey of stochastic ω-regular games. - Krishnendu Chatterjee; Thomas A. Henzinger (J. Comput. Syst. Sci., 2012)

Energy parity games. - Krishnendu Chatterjee; Laurent Doyen 001 (Theor. Comput. Sci., 2012)

Image Enhancement in Transient Lock-In Thermography Through Time Series Reconstruction and Spatial Slope Correction. - Krishnendu Chatterjee; Suneet Tuli (IEEE Trans. Instrum. Meas., 2012)

Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. - Krishnendu Chatterjee; Andreas Gaiser; Jan Kretínský (CAV, 2013)

Faster Algorithms for Markov Decision Processes with Low Treewidth. - Krishnendu Chatterjee; Jakub Lacki (CAV, 2013)

TTP: Tool for Tumor Progression. - Johannes G. Reiter; Ivana Bozic; Krishnendu Chatterjee; Martin A. Nowak (CAV, 2013)

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (CSL, 2013)

Infinite-state games with finitary conditions. - Krishnendu Chatterjee; Nathanaël Fijalkow (CSL, 2013)

Distributed synthesis for LTL fragments. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop; Andreas Pavlogiannis (FMCAD, 2013)

Automated analysis of real-time scheduling using graph games. - Krishnendu Chatterjee; Alexander Kößler; Ulrich Schmid 001 (HSCC, 2013)

Quantitative timed simulation functions and refinement metrics for real-time systems. - Krishnendu Chatterjee; Vinayak S. Prabhu (HSCC, 2013)

How to Travel between Languages. - Krishnendu Chatterjee; Siddhesh Chaubal; Sasha Rubin (LATA, 2013)

Multi-objective Discounted Reward Verification in Graphs and MDPs. - Krishnendu Chatterjee; Vojtech Forejt; Dominik Wojtczak (LPAR, 2013)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer (GandALF, 2013)

A survey of partial-observation stochastic parity games. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Formal Methods Syst. Des., 2013)

Code aware resource management. - Krishnendu Chatterjee; Luca de Alfaro; Marco Faella; Rupak Majumdar; Vishwanath Raman (Formal Methods Syst. Des., 2013)

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. - Krishnendu Chatterjee; Monika Henzinger; Manas Joglekar; Nisarg Shah 001 (Formal Methods Syst. Des., 2013)

Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. - Krishnendu Chatterjee; Vinayak S. Prabhu (Inf. Comput., 2013)

The Complexity of Coverage. - Krishnendu Chatterjee; Luca de Alfaro; Rupak Majumdar (Int. J. Found. Comput. Sci., 2013)

Strategy improvement for concurrent reachability and turn-based stochastic safety games. - Krishnendu Chatterjee; Luca de Alfaro; Thomas A. Henzinger (J. Comput. Syst. Sci., 2013)

Synthesis of AMBA AHB from formal specification: a case study. - Yashdeep Godhal; Krishnendu Chatterjee; Thomas A. Henzinger (Int. J. Softw. Tools Technol. Transf., 2013)

Verification of Markov Decision Processes Using Learning Algorithms. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Vojtech Forejt; Jan Kretínský; Marta Z. Kwiatkowska; David Parker 001; Mateusz Ujma (ATVA, 2014)

CEGAR for Qualitative Analysis of Probabilistic Systems. - Krishnendu Chatterjee; Martin Chmelik; Przemyslaw Daca (CAV, 2014)

Qualitative Concurrent Parity Games: Bounded Rationality. - Krishnendu Chatterjee (CONCUR, 2014)

Perfect-Information Stochastic Mean-Payoff Parity Games. - Krishnendu Chatterjee; Laurent Doyen 001; Hugo Gimbert; Youssouf Oualhadj (FoSSaCS, 2014)

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. - Krishnendu Chatterjee; Laurent Doyen 001; Sumit Nain; Moshe Y. Vardi (FoSSaCS, 2014)

Edit distance for timed automata. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Rupak Majumdar (HSCC, 2014)

Games with a Weak Adversary. - Krishnendu Chatterjee; Laurent Doyen 001 (ICALP (2), 2014)

The Complexity of Ergodic Mean-payoff Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (ICALP (2), 2014)

Game theoretic secure localization in wireless sensor networks. - Susmit Jha; Stavros Tripakis; Sanjit A. Seshia; Krishnendu Chatterjee (IOT, 2014)

Partial-Observation Stochastic Reachability and Parity Games. - Krishnendu Chatterjee (MFCS (1), 2014)

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (RTSS, 2014)

Synthesizing robust systems. - Roderick Bloem; Krishnendu Chatterjee; Karin Greimel; Thomas A. Henzinger; Georg Hofferek; Barbara Jobstmann; Bettina Könighofer; Robert Könighofer (Acta Informatica, 2014)

Strategy synthesis for multi-dimensional quantitative objectives. - Krishnendu Chatterjee; Mickael Randour; Jean-François Raskin (Acta Informatica, 2014)

Polynomial-Time Algorithms for Energy Games with Special Weight Structures. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Danupon Nanongkai (Algorithmica, 2014)

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (CoRR, 2014)

Generalized Risk-Aversion in Stochastic Multi-Armed Bandits. - Alexander Zimin; Rasmus Ibsen-Jensen; Krishnendu Chatterjee (CoRR, 2014)

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes - Tomás Brázdil; Václav Brozek; Krishnendu Chatterjee; Vojtech Forejt; Antonín Kucera 001 (Log. Methods Comput. Sci., 2014)

Assume-guarantee synthesis for digital contract signing. - Krishnendu Chatterjee; Vishwanath Raman (Formal Aspects Comput., 2014)

Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. - Krishnendu Chatterjee; Monika Henzinger (J. ACM, 2014)

The Time Scale of Evolutionary Innovation. - Krishnendu Chatterjee; Andreas Pavlogiannis; Ben Adlam; Martin A. Nowak (PLoS Comput. Biol., 2014)

Approximating the minimum cycle mean. - Krishnendu Chatterjee; Monika Henzinger; Sebastian Krinninger; Veronika Loitzenbauer; Michael A. Raskin (Theor. Comput. Sci., 2014)

Temporal Specifications with Accumulative Values. - Udi Boker; Krishnendu Chatterjee; Thomas A. Henzinger; Orna Kupferman (ACM Trans. Comput. Log., 2014)

Partial-Observation Stochastic Games: How to Win when Belief Fails. - Krishnendu Chatterjee; Laurent Doyen 001 (ACM Trans. Comput. Log., 2014)

Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games. - Umair Z. Ahmed; Krishnendu Chatterjee; Sumit Gulwani (AAAI, 2015)

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Andreas Fellner; Jan Kretínský (CAV (1), 2015)

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (CAV (1), 2015)

Temporal logic motion planning using POMDPs with parity objectives: case study paper. - María Svorenová; Martin Chmelik; Kevin Leahy 001; Hasan Ferit Eniser; Krishnendu Chatterjee; Ivana Cerná; Calin Belta (HSCC, 2015)

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. - María Svorenová; Jan Kretínský; Martin Chmelik; Krishnendu Chatterjee; Ivana Cerná; Calin Belta (HSCC, 2015)

The Complexity of Synthesis from Probabilistic Components. - Krishnendu Chatterjee; Laurent Doyen 001; Moshe Y. Vardi (ICALP (2), 2015)

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. - Krishnendu Chatterjee; Martin Chmelik; Raghav Gupta; Ayush Kanodia (ICRA, 2015)

Improved Algorithms for One-Pair and k-Pair Streett Objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer (LICS, 2015)

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis; Prateesh Goyal (POPL, 2015)

Quantitative Interprocedural Analysis. - Krishnendu Chatterjee; Andreas Pavlogiannis; Yaron Velner (POPL, 2015)

The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (SODA, 2015)

Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. - Roderick Bloem; Krishnendu Chatterjee; Swen Jacobs; Robert Könighofer (TACAS, 2015)

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. - Tomás Brázdil; Krishnendu Chatterjee; Vojtech Forejt; Antonín Kucera 001 (TACAS, 2015)

POMDPs under probabilistic semantics. - Krishnendu Chatterjee; Martin Chmelik (Artif. Intell., 2015)

Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (CoRR, 2015)

Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). - Krishnendu Chatterjee; Stéphane Lafortune; Nicolas Markey; Wolfgang Thomas (Dagstuhl Reports, 2015)

CEGAR for compositional analysis of qualitative properties in Markov decision processes. - Krishnendu Chatterjee; Martin Chmelik; Przemyslaw Daca (Formal Methods Syst. Des., 2015)

Evolution of Decisions in Population Games with Sequentially Searching Individuals. - Tadeas Priklopil; Krishnendu Chatterjee (Games, 2015)

Randomness for free. - Krishnendu Chatterjee; Laurent Doyen 001; Hugo Gimbert; Thomas A. Henzinger (Inf. Comput., 2015)

Looking at mean-payoff and total-payoff through windows. - Krishnendu Chatterjee; Laurent Doyen 001; Mickael Randour; Jean-François Raskin (Inf. Comput., 2015)

Qualitative analysis of concurrent mean-payoff games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (Inf. Comput., 2015)

Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria. - Krishnendu Chatterjee; Jirí Sgall (Inf. Comput., 2015)

The complexity of multi-mean-payoff and multi-energy games. - Yaron Velner; Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger; Alexander Moshe Rabinovich; Jean-François Raskin (Inf. Comput., 2015)

Probabilistic opacity for Markov decision processes. - Béatrice Bérard; Krishnendu Chatterjee; Nathalie Sznajder (Inf. Process. Lett., 2015)

Measuring and Synthesizing Systems in Probabilistic Environments. - Krishnendu Chatterjee; Thomas A. Henzinger; Barbara Jobstmann; Rohit Singh 002 (J. ACM, 2015)

Quantitative Temporal Simulation and Refinement Distances for Timed Systems. - Krishnendu Chatterjee; Vinayak S. Prabhu (IEEE Trans. Autom. Control., 2015)

Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. - Krishnendu Chatterjee; Manas Joglekar; Nisarg Shah 001 (Theor. Comput. Sci., 2015)

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. - Krishnendu Chatterjee; Martin Chmelik; Jessica Davies 001 (AAAI, 2016)

Indefinite-Horizon Reachability in Goal-DEC-POMDPs. - Krishnendu Chatterjee; Martin Chmelik (ICAPS, 2016)

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Anchit Gupta; Petr Novotný 001 (AAMAS, 2016)

Termination Analysis of Probabilistic Programs Through Positivstellensatz's. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady (CAV (1), 2016)

Game-theoretic models identify useful principles for peer collaboration in online learning platforms. - Vineet Pandey; Krishnendu Chatterjee (CSCW Companion, 2016)

The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen (ECAI, 2016)

Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESA, 2016)

Computation Tree Logic for Synchronization Properties. - Krishnendu Chatterjee; Laurent Doyen 001 (ICALP, 2016)

Robust Draws in Balanced Knockout Tournaments. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Josef Tkadlec (IJCAI, 2016)

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. - Krishnendu Chatterjee; Laurent Doyen 001 (LICS, 2016)

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (LICS, 2016)

Conditionally Optimal Algorithms for Generalized Büchi Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (MFCS, 2016)

Nested Weighted Limit-Average Automata of Bounded Width. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (MFCS, 2016)

Quantitative Monitor Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (SAS, 2016)

Optimal cost almost-sure reachability in POMDPs. - Krishnendu Chatterjee; Martin Chmelik; Raghav Gupta; Ayush Kanodia (Artif. Intell., 2016)

Stochastic Shortest Path with Energy Constraints in POMDPs. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Anchit Gupta; Petr Novotný 001 (CoRR, 2016)

Optimizing Expectation with Guarantees in POMDPs (Technical Report). - Krishnendu Chatterjee; Petr Novotný 001; Guillermo A. Pérez 001; Jean-François Raskin; Dorde Zikelic (CoRR, 2016)

Data-centric Dynamic Partial Order Reduction. - Krishnendu Chatterjee; Andreas Pavlogiannis; Nishant Sinha; Kapil Vaidya (CoRR, 2016)

What is decidable about partially observable Markov decision processes with ω-regular objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (J. Comput. Syst. Sci., 2016)

Optimizing Expectation with Guarantees in POMDPs. - Krishnendu Chatterjee; Petr Novotný 001; Guillermo A. Pérez 001; Jean-François Raskin; Dorde Zikelic (AAAI, 2017)

JTDec: A Tool for Tree Decompositions in Soot. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ATVA, 2017)

The Cost of Exactness in Quantitative Reachability. - Krishnendu Chatterjee; Laurent Doyen 001; Thomas A. Henzinger (Models, Algorithms, Logics and Tools, 2017)

Value Iteration for Long-Run Average Reward in Markov Decision Processes. - Pranav Ashok; Krishnendu Chatterjee; Przemyslaw Daca; Jan Kretínský; Tobias Meggendorfer (CAV (1), 2017)

Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. - Krishnendu Chatterjee; Hongfei Fu 001; Aniket Murhekar (CAV (1), 2017)

Bidirectional Nested Weighted Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2017)

Improved Set-Based Symbolic Algorithms for Parity Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (CSL, 2017)

Faster Algorithms for Weighted Recursive State Machines. - Krishnendu Chatterjee; Bernhard Kragl; Samarth Mishra; Andreas Pavlogiannis (ESOP, 2017)

Strategy Complexity of Concurrent Safety Games. - Krishnendu Chatterjee; Kristoffer Arnsfelt Hansen; Rasmus Ibsen-Jensen (MFCS, 2017)

Faster Algorithms for Mean-Payoff Parity Games. - Krishnendu Chatterjee; Monika Henzinger; Alexander Svozil (MFCS, 2017)

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Martin A. Nowak (MFCS, 2017)

Stochastic invariants for probabilistic termination. - Krishnendu Chatterjee; Petr Novotný 001; Dorde Zikelic (POPL, 2017)

Special issue: Synthesis and SYNT 2014. - Krishnendu Chatterjee; Rüdiger Ehlers (Acta Informatica, 2017)

Termination of Nondeterministic Recursive Probabilistic Programs. - Krishnendu Chatterjee; Hongfei Fu 001 (CoRR, 2017)

Efficient Algorithms for Checking Fast Termination in VASS. - Tomás Brázdil; Krishnendu Chatterjee; Antonín Kucera 001; Petr Novotný 001; Dominik Velan (CoRR, 2017)

Doomsday equilibria for omega-regular games. - Krishnendu Chatterjee; Laurent Doyen 001; Emmanuel Filiot; Jean-François Raskin (Inf. Comput., 2017)

Quantitative fair simulation games. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop; Yaron Velner (Inf. Comput., 2017)

Pushdown reachability with constant treewidth. - Krishnendu Chatterjee; Georg Osang (Inf. Process. Lett., 2017)

The Complexity of Mean-Payoff Pushdown Games. - Krishnendu Chatterjee; Yaron Velner (J. ACM, 2017)

Trading performance for stability in Markov decision processes. - Tomás Brázdil; Krishnendu Chatterjee; Vojtech Forejt; Antonín Kucera 001 (J. Comput. Syst. Sci., 2017)

Hyperplane separation technique for multidimensional mean-payoff games. - Krishnendu Chatterjee; Yaron Velner (J. Comput. Syst. Sci., 2017)

Obligation Blackwell Games and P-Automata. - Krishnendu Chatterjee; Nir Piterman (J. Symb. Log., 2017)

Edit Distance for Pushdown Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Rasmus Ibsen-Jensen; Jan Otop (Log. Methods Comput. Sci., 2017)

Improved Algorithms for Parity and Streett objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer (Log. Methods Comput. Sci., 2017)

Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. - Krishnendu Chatterjee; Zuzana Kretínská; Jan Kretínský (Log. Methods Comput. Sci., 2017)

Nested Weighted Automata. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (ACM Trans. Comput. Log., 2017)

Sensor Synthesis for POMDPs with Reachability Objectives. - Krishnendu Chatterjee; Martin Chmelik; Ufuk Topcu (ICAPS, 2018)

New Approaches for Almost-Sure Termination of Probabilistic Programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee (APLAS, 2018)

Computing Average Response Time. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (Principles of Modeling, 2018)

Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. - Krishnendu Chatterjee; Monika Henzinger; Veronika Loitzenbauer; Simin Oraee; Viktor Toman (CAV (2), 2018)

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Yaron Velner (CONCUR, 2018)

Quantitative Analysis of Smart Contracts. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Yaron Velner (ESOP, 2018)

Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. - Krishnendu Chatterjee; Adrián Elgyütt; Petr Novotný 001; Owen Rouillé (IJCAI, 2018)

Computational Approaches for Stochastic Shortest Path on Succinct MDPs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Nastaran Okati (IJCAI, 2018)

Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. - Karel Horák 002; Branislav Bosanský; Krishnendu Chatterjee (IJCAI, 2018)

Secure Credit Reporting on the Blockchain. - Amir Kafshdar Goharshady; Ali Behrouz; Krishnendu Chatterjee (iThings/GreenCom/CPSCom/SmartData, 2018)

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. - Tomás Brázdil; Krishnendu Chatterjee; Antonín Kucera 001; Petr Novotný 001; Dominik Velan; Florian Zuleger (LICS, 2018)

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LPAR, 2018)

Parameter-Independent Strategies for pMDPs via POMDPs. - Sebastian Arming; Ezio Bartocci; Krishnendu Chatterjee; Joost-Pieter Katoen; Ana Sokolova (QEST, 2018)

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Veronika Loitzenbauer (SODA, 2018)

Strategy Representation by Decision Trees in Reactive Synthesis. - Tomás Brázdil; Krishnendu Chatterjee; Jan Kretínský; Viktor Toman (TACAS (1), 2018)

Strong Amplifiers of Natural Selection: Proofs. - Andreas Pavlogiannis; Josef Tkadlec; Krishnendu Chatterjee; Martin A. Nowak (CoRR, 2018)

Coverability: Realizability Lower Bounds. - Krishnendu Chatterjee; Nir Piterman (CoRR, 2018)

Fixation probability and fixation time in structured populations. - Josef Tkadlec; Andreas Pavlogiannis; Krishnendu Chatterjee; Martin A. Nowak (CoRR, 2018)

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. - Sheshansh Agrawal; Krishnendu Chatterjee; Petr Novotný 001 (Proc. ACM Program. Lang., 2018)

Data-centric dynamic partial order reduction. - Marek Chalupa; Krishnendu Chatterjee; Andreas Pavlogiannis; Nishant Sinha; Kapil Vaidya (Proc. ACM Program. Lang., 2018)

Optimal Dyck reachability for data-dependence and alias analysis. - Krishnendu Chatterjee; Bhavya Choudhary; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2018)

Automated competitive analysis of real-time scheduling with graph games. - Krishnendu Chatterjee; Andreas Pavlogiannis; Alexander Kößler; Ulrich Schmid 001 (Real Time Syst., 2018)

Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. - Krishnendu Chatterjee; Hongfei Fu 001; Petr Novotný 001; Rouzbeh Hasheminezhad (ACM Trans. Program. Lang. Syst., 2018)

Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Amir Kafshdar Goharshady; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2018)

Graph Games and Reactive Synthesis. - Roderick Bloem; Krishnendu Chatterjee; Barbara Jobstmann (Handbook of Model Checking, 2018)

Deciding Fast Termination for Probabilistic VASS with Nondeterminism. - Tomás Brázdil; Krishnendu Chatterjee; Antonín Kucera 001; Petr Novotný 001; Dominik Velan (ATVA, 2019)

Run-Time Optimization for Learned Controllers Through Quantitative Games. - Guy Avni; Roderick Bloem; Krishnendu Chatterjee; Thomas A. Henzinger; Bettina Könighofer; Stefan Pranger (CAV (1), 2019)

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (CONCUR, 2019)

Long-Run Average Behavior of Vector Addition Systems with States. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2019)

Combinations of Qualitative Winning for Stochastic Parity Games. - Krishnendu Chatterjee; Nir Piterman (CONCUR, 2019)

Probabilistic Smart Contracts: Secure Randomness on the Blockchain. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Arash Pourdamghani (IEEE ICBC, 2019)

The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. - Laura Schmid; Krishnendu Chatterjee; Stefan Schmid 001 (OPODIS, 2019)

Cost analysis of nondeterministic probabilistic programs. - Peixin Wang; Hongfei Fu 001; Amir Kafshdar Goharshady; Krishnendu Chatterjee; Xudong Qin; Wenjun Shi (PLDI, 2019)

Strategy Representation by Decision Trees with Linear Classifiers. - Pranav Ashok; Tomás Brázdil; Krishnendu Chatterjee; Jan Kretínský; Christoph H. Lampert; Viktor Toman (QEST, 2019)

The treewidth of smart contracts. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady (SAC, 2019)

Hybrid mining: exploiting blockchain's computational power for distributed problem solving. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Arash Pourdamghani (SAC, 2019)

Termination of Nondeterministic Probabilistic Programs. - Hongfei Fu 001; Krishnendu Chatterjee (VMCAI, 2019)

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (CoRR, 2019)

Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time. - Peixin Wang; Hongfei Fu 001; Krishnendu Chatterjee; Kangli He; Ming Xu 010 (CoRR, 2019)

The Complexity of POMDPs with Long-run Average Objectives. - Krishnendu Chatterjee; Raimundo Saona; Bruno Ziliotto (CoRR, 2019)

Quantitative Automata under Probabilistic Semantics. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (Log. Methods Comput. Sci., 2019)

Efficient parameterized algorithms for data packing. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Nastaran Okati; Andreas Pavlogiannis (Proc. ACM Program. Lang., 2019)

Value-centric dynamic partial order reduction. - Krishnendu Chatterjee; Andreas Pavlogiannis; Viktor Toman (Proc. ACM Program. Lang., 2019)

Modular verification for almost-sure termination of probabilistic programs. - Mingzhang Huang; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (Proc. ACM Program. Lang., 2019)

Non-polynomial Worst-Case Analysis of Recursive Programs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady (ACM Trans. Program. Lang. Syst., 2019)

Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Prateesh Goyal; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ACM Trans. Program. Lang. Syst., 2019)

Termination Analysis of Probabilistic Programs with Martingales. - Krishnendu Chatterjee; Hongfei Fu 001; Petr Novotný 001 (Foundations of Probabilistic Programming, 2020)

Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. - Tomás Brázdil; Krishnendu Chatterjee; Petr Novotný 001; Jiri Vahala (AAAI, 2020)

Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. - Krishnendu Chatterjee; Martin Chmelík; Deep Karkhanis; Petr Novotný 001; Amélie Royer (ICAPS, 2020)

Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (ATVA, 2020)

Stochastic Games with Lexicographic Reachability-Safety Objectives. - Krishnendu Chatterjee; Joost-Pieter Katoen; Maximilian Weininger; Tobias Winkler 001 (CAV (2), 2020)

Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. - Krishnendu Chatterjee; Thomas A. Henzinger; Jan Otop (CONCUR, 2020)

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (ESOP, 2020)

Approximating Values of Generalized-Reachability Stochastic Games. - Pranav Ashok; Krishnendu Chatterjee; Jan Kretínský; Maximilian Weininger; Tobias Winkler 001 (LICS, 2020)

Simplified Game of Life: Algorithms and Complexity. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (MFCS, 2020)

Polynomial invariant generation for non-deterministic recursive programs. - Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady (PLDI, 2020)

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. - Ali Asadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Kiarash Mohammadi; Andreas Pavlogiannis (CoRR, 2020)

Inductive Reachability Witnesses. - Ali Asadi; Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Mohammad Mahdavi (CoRR, 2020)

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. - Jinyi Wang; Yican Sun; Hongfei Fu 001; Mingzhang Huang; Amir Kafshdar Goharshady; Krishnendu Chatterjee (CoRR, 2020)

Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. - Peixin Wang; Hongfei Fu 001; Krishnendu Chatterjee; Yuxin Deng; Ming Xu 010 (Proc. ACM Program. Lang., 2020)

Limits on amplifiers of natural selection under death-Birth updating. - Josef Tkadlec; Andreas Pavlogiannis; Krishnendu Chatterjee; Martin A. Nowak (PLoS Comput. Biol., 2020)

Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. - Andreas Pavlogiannis; Nico Schaumberger; Ulrich Schmid 001; Krishnendu Chatterjee (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020)

The Moran process on 2-chromatic graphs. - Kamran Kaveh; Alex McAvoy; Krishnendu Chatterjee; Martin A. Nowak (PLoS Comput. Biol., 2020)

Stateless Model Checking Under a Reads-Value-From Equivalence. - Pratyush Agarwal; Krishnendu Chatterjee; Shreya Pathak; Andreas Pavlogiannis; Viktor Toman (CAV (1), 2021)

Quantitative Verification on Product Graphs of Small Treewidth. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (FSTTCS, 2021)

Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. - Krishnendu Chatterjee; Monika Henzinger; Sagar Kale; Alexander Svozil (ICALP, 2021)

Solving Partially Observable Stochastic Shortest-Path Games. - Petr Tomásek; Karel Horák 002; Aditya Aradhye; Branislav Bosanský; Krishnendu Chatterjee (IJCAI, 2021)

Symbolic Time and Space Tradeoffs for Probabilistic Verification. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (LICS, 2021)

Infinite Time Horizon Safety of Bayesian Neural Networks. - Mathias Lechner; Dorde Zikelic; Krishnendu Chatterjee; Thomas A. Henzinger (NeurIPS, 2021)

Polynomial reachability witnesses via Stellensätze. - Ali Asadi; Krishnendu Chatterjee; Hongfei Fu 001; Amir Kafshdar Goharshady; Mohammad Mahdavi (PLDI, 2021)

Proving non-termination by program reversal. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Petr Novotný 001; Dorde Zikelic (PLDI, 2021)

Quantitative analysis of assertion violations in probabilistic programs. - Jinyi Wang; Yican Sun; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (PLDI, 2021)

On Satisficing in Quantitative Games. - Suguman Bansal; Krishnendu Chatterjee; Moshe Y. Vardi (TACAS (1), 2021)

Algorithms and conditional lower bounds for planning problems. - Krishnendu Chatterjee; Wolfgang Dvorák; Monika Henzinger; Alexander Svozil (Artif. Intell., 2021)

Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory. - Juho Hirvonen; Laura Schmid; Krishnendu Chatterjee; Stefan Schmid 001 (CoRR, 2021)

Optimal strategies for selecting coordinators. - Martin Zeiner; Ulrich Schmid 001; Krishnendu Chatterjee (Discret. Appl. Math., 2021)

Faster algorithms for quantitative verification in bounded treewidth graphs. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Andreas Pavlogiannis (Formal Methods Syst. Des., 2021)

The reads-from equivalence for the TSO and PSO memory models. - Truc Lam Bui; Krishnendu Chatterjee; Tushar Gautam; Andreas Pavlogiannis; Viktor Toman (Proc. ACM Program. Lang., 2021)

Mistakes can stabilise the dynamics of rock-paper-scissors games. - Maria Kleshnina; Sabrina S. Streipert; Jerzy A. Filar; Krishnendu Chatterjee (PLoS Comput. Biol., 2021)

Stability Verification in Stochastic Control Systems via Neural Network Supermartingales. - Mathias Lechner; Dorde Zikelic; Krishnendu Chatterjee; Thomas A. Henzinger (AAAI, 2022)

Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Dorde Zikelic (CAV (1), 2022)

Algorithms and Hardness Results for Computing Cores of Markov Chains. - Ali Ahmadi; Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Roodabeh Safavi; Dorde Zikelic (FSTTCS, 2022)

Complexity of Spatial Games. - Krishnendu Chatterjee; Rasmus Ibsen-Jensen; Ismaël Jecker; Jakub Svoboda (FSTTCS, 2022)

Learning Stabilizing Policies in Stochastic Control Systems. - Dorde Zikelic; Mathias Lechner; Krishnendu Chatterjee; Thomas A. Henzinger (CoRR, 2022)

Online Admission Control and Rebalancing in Payment Channel Networks. - Mahsa Bastankhah; Krishnendu Chatterjee; Mohammad Ali Maddah-Ali; Stefan Schmid 001; Jakub Svoboda; Michelle Yeo (CoRR, 2022)

Repeated Prophet Inequality with Near-optimal Bounds. - Krishnendu Chatterjee; Mona Mohammadi; Raimundo Saona (CoRR, 2022)

Social Balance on Networks: Local Minima and Best Edge Dynamics. - Krishnendu Chatterjee; Jakub Svoboda; Dorde Zikelic; Andreas Pavlogiannis; Josef Tkadlec (CoRR, 2022)

Learning Control Policies for Region Stabilization in Stochastic Systems. - Matin Ansaripour; Mathias Lechner; Dorde Zikelic; Krishnendu Chatterjee; Thomas A. Henzinger (CoRR, 2022)

Graph planning with expected finite horizon. - Krishnendu Chatterjee; Laurent Doyen 001 (J. Comput. Syst. Sci., 2022)

Finite-Memory Strategies in POMDPs with Long-Run Average Objectives. - Krishnendu Chatterjee; Raimundo Saona; Bruno Ziliotto (Math. Oper. Res., 2022)

Direct reciprocity between individuals that use different strategy spaces. - Laura Schmid; Christian Hilbe; Krishnendu Chatterjee; Martin A. Nowak (PLoS Comput. Biol., 2022)

Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks. - Mathias Lechner; Dorde Zikelic; Krishnendu Chatterjee; Thomas A. Henzinger; Daniela Rus (AAAI, 2023)

Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees. - Dorde Zikelic; Mathias Lechner; Thomas A. Henzinger; Krishnendu Chatterjee (AAAI, 2023)

Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems. - Matin Ansaripour; Krishnendu Chatterjee; Thomas A. Henzinger; Mathias Lechner; Dorde Zikelic (ATVA (1), 2023)

MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. - S. Akshay 001; Krishnendu Chatterjee; Tobias Meggendorfer; Dorde Zikelic (CAV (3), 2023)

Automated Tail Bound Analysis for Probabilistic Recurrence Relations. - Yican Sun; Hongfei Fu 001; Krishnendu Chatterjee; Amir Kafshdar Goharshady (CAV (3), 2023)

R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control. - Mahsa Bastankhah; Krishnendu Chatterjee; Mohammad Ali Maddah-Ali; Stefan Schmid 001; Jakub Svoboda; Michelle Yeo (FC (1), 2023)

Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees. - Dorde Zikelic; Mathias Lechner; Abhinav Verma; Krishnendu Chatterjee; Thomas A. Henzinger (NeurIPS, 2023)

On the Convergence Time in Graphical Games: A Locality-Sensitive Approach. - Juho Hirvonen; Laura Schmid; Krishnendu Chatterjee; Stefan Schmid 001 (OPODIS, 2023)

Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. - Krishnendu Chatterjee; Tobias Meggendorfer; Raimundo Saona; Jakub Svoboda (SODA, 2023)

A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems. - Krishnendu Chatterjee; Thomas A. Henzinger; Mathias Lechner; Dorde Zikelic (TACAS (1), 2023)

Repeated Game Dynamics in Population Protocols. - Dan Alistarh; Krishnendu Chatterjee; Mehrdad Karrabi; John Lazarsfeld (CoRR, 2023)

On Lexicographic Proof Rules for Probabilistic Termination. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Petr Novotný 001; Jiri Zárevúcky; Dorde Zikelic (Formal Aspects Comput., 2023)

Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Dorde Zikelic (FM (1), 2024)

Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms. - Ali Asadi; Krishnendu Chatterjee; Raimundo Saona; Jakub Svoboda (FSTTCS, 2024)

Reinforcement Learning from Reachability Specifications: PAC Guarantees with Expected Conditional Distance. - Jakub Svoboda; Suguman Bansal; Krishnendu Chatterjee (ICML, 2024)

Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties. - S. Akshay 001; Krishnendu Chatterjee; Tobias Meggendorfer; Dorde Zikelic (IJCAI, 2024)

Solving Long-run Average Reward Robust MDPs via Stochastic Games. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Petr Novotný 001; Dorde Zikelic (IJCAI, 2024)

Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. - Ali Asadi; Krishnendu Chatterjee; Jakub Svoboda; Raimundo Saona Urmeneta (LICS, 2024)

Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm. - Esra Ceylan; Krishnendu Chatterjee; Stefan Schmid 001; Jakub Svoboda (NOMS, 2024)

Game Dynamics and Equilibrium Computation in the Population Protocol Model. - Dan Alistarh; Krishnendu Chatterjee; Mehrdad Karrabi; John Lazarsfeld (PODC, 2024)

Ergodic Unobservable MDPs: Decidability of Approximation. - Krishnendu Chatterjee; David Lurie; Raimundo Saona; Bruno Ziliotto (CoRR, 2024)

PolyHorn: A Polynomial Horn Clause Solver. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Milad Saadat; Dorde Zikelic (CoRR, 2024)

Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. - Krishnendu Chatterjee; Amirali Ebrahim-Zadeh; Mehrdad Karrabi; Krzysztof Pietrzak; Michelle Yeo; Dorde Zikelic (IACR Cryptol. ePrint Arch., 2024)

Entropic risk for turn-based stochastic games. - Christel Baier; Krishnendu Chatterjee; Tobias Meggendorfer; Jakob Piribauer (Inf. Comput., 2024)

Stochastic Processes with Expected Stopping Time. - Krishnendu Chatterjee; Laurent Doyen 001 (Log. Methods Comput. Sci., 2024)

Quantitative Bounds on Resource Usage of Probabilistic Programs. - Krishnendu Chatterjee; Amir Kafshdar Goharshady; Tobias Meggendorfer; Dorde Zikelic (Proc. ACM Program. Lang., 2024)

Equivalence and Similarity Refutation for Probabilistic Programs. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Petr Novotný 001; Dorde Zikelic (Proc. ACM Program. Lang., 2024)

Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. - Jakub Svoboda; Soham Joshi; Josef Tkadlec; Krishnendu Chatterjee (PLoS Comput. Biol., 2024)

Stochastic games with lexicographic objectives. - Krishnendu Chatterjee; Joost-Pieter Katoen; Stefanie Mohr; Maximilian Weininger; Tobias Winkler 001 (Formal Methods Syst. Des., 2024)

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Harshit J. Motwani; Maximilian Seeliger; Dorde Zikelic (AAAI, 2025)

Linear Equations with Min and Max Operators: Computational Complexity. - Krishnendu Chatterjee; Ruichen Luo; Raimundo Saona; Jakub Svoboda (AAAI, 2025)

The Value Problem for Multiple-Environment MDPs with Parity Objective. - Krishnendu Chatterjee; Laurent Doyen 001; Jean-François Raskin; Ocan Sankur (ICALP, 2025)

Refuting Equivalence in Probabilistic Programs with Conditioning. - Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Petr Novotný 001; Dorde Zikelic (TACAS (2), 2025)

Value Iteration with Guessing for Markov Chains and Markov Decision Processes. - Krishnendu Chatterjee; Mahdi JafariRaviz; Raimundo Saona; Jakub Svoboda (TACAS (2), 2025)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs. - Krishnendu Chatterjee; Tim Quatmann; Maximilian Schäffeler; Maximilian Weininger; Tobias Winkler 001; Daniel Zilken (TACAS (2), 2025)

Lower Bound on Howard Policy Iteration for Deterministic Markov Decision Processes. - Ali Asadi; Krishnendu Chatterjee; Jakob de Raaij (UAI, 2025)

Limit-sure Reachability for Small Memory Policies in POMDPs is NP-complete. - Ali Asadi; Krishnendu Chatterjee; Raimundo Saona; Ali Shafiee (UAI, 2025)

When is liquid democracy possible? On the manipulation of variance. - Krishnendu Chatterjee; Seth Gilbert; Stefan Schmid 001; Jakub Svoboda; Michelle Yeo (IACR Cryptol. ePrint Arch., 2025)

Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection. - Krishnendu Chatterjee; Jan Matyás Kristan; Stefan Schmid 001; Jakub Svoboda; Michelle Yeo (IACR Cryptol. ePrint Arch., 2025)

Learning Algorithms for Verification of Markov Decision Processes. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Vojtech Forejt; Jan Kretínský; Marta Kwiatkowska; Tobias Meggendorfer; David Parker 001; Mateusz Ujma (TheoretiCS, 2025)

Limitation of Time Promotes Cooperation in Structured Collaboration Systems. - Yichao Zhang 001; Jiasheng Wang; Guanghui Wen; Jihong Guan; Shuigeng Zhou; Guanrong Chen; Krishnendu Chatterjee; Matjaz Perc (IEEE Trans. Netw. Sci. Eng., 2025)

Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs. - Krishnendu Chatterjee; Tim Quatmann; Maximilian Schäffeler; Maximilian Weininger; Tobias Winkler 001; Daniel Zillken (Zenodo, 2025)

Multiplicative Rewards in Markovian Models. - Christel Baier; Krishnendu Chatterjee; Tobias Meggendorfer; Jakob Piribauer (CoRR, 2025)

Qualitative Analysis of ω-Regular Objectives on Robust MDPs. - Ali Asadi; Krishnendu Chatterjee; Ehsan Kafshdar Goharshady; Mehrdad Karrabi; Ali Shafiee (CoRR, 2025)

Risk-aware Markov Decision Processes Using Cumulative Prospect Theory. - Thomas Brihaye; Krishnendu Chatterjee; Stefanie Mohr; Maximilian Weininger (CoRR, 2025)

ε-Stationary Nash Equilibria in Multi-player Stochastic Graph Games. - Ali Asadi; Léonard Brice; Krishnendu Chatterjee; K. S. Thejaswini (CoRR, 2025)