| 2008 |
|---|
| 42 | EE | Krishnendu Chatterjee,
Koushik Sen,
Thomas A. Henzinger:
Model-Checking omega-Regular Properties of Interval Markov Chains.
FoSSaCS 2008: 302-317 |
| 41 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Rupak Majumdar:
The Complexity of Coverage
CoRR abs/0804.4525: (2008) |
| 40 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Thomas A. Henzinger:
Strategy Improvement for Concurrent Safety Games
CoRR abs/0804.4530: (2008) |
| 39 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Reduction of stochastic parity to stochastic mean-payoff games.
Inf. Process. Lett. 106(1): 1-7 (2008) |
| 2007 |
|---|
| 38 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Nir Piterman:
Strategy Logic.
CONCUR 2007: 59-73 |
| 37 | EE | Krishnendu Chatterjee:
Stochastic Müller Games are PSPACE-Complete.
FSTTCS 2007: 436-448 |
| 36 | EE | Krishnendu Chatterjee:
Markov Decision Processes with Multiple Long-Run Average Objectives.
FSTTCS 2007: 473-484 |
| 35 | EE | Krishnendu Chatterjee:
Optimal Strategy Synthesis in Stochastic Müller Games.
FoSSaCS 2007: 138-152 |
| 34 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Nir Piterman:
Generalized Parity Games.
FoSSaCS 2007: 153-167 |
| 33 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Assume-Guarantee Synthesis.
TACAS 2007: 261-275 |
| 32 | EE | Krishnendu Chatterjee,
Laurent Doyen,
Thomas A. Henzinger,
Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information
CoRR abs/0706.2619: (2007) |
| 31 | EE | Jean-François Raskin,
Krishnendu Chatterjee,
Laurent Doyen,
Thomas A. Henzinger:
Algorithms for Omega-Regular Games with Imperfect Information.
Logical Methods in Computer Science 3(3): (2007) |
| 30 | EE | Krishnendu Chatterjee:
Concurrent games with tail objectives.
Theor. Comput. Sci. 388(1-3): 181-198 (2007) |
| 2006 |
|---|
| 29 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Strategy Improvement for Stochastic Rabin and Streett Games.
CONCUR 2006: 375-389 |
| 28 | EE | Krishnendu Chatterjee,
Radha Jagadeesan,
Corin Pitcher:
Games for Controls.
CSFW 2006: 70-84 |
| 27 | EE | Krishnendu Chatterjee:
Concurrent Games with Tail Objectives.
CSL 2006: 256-270 |
| 26 | EE | Krishnendu Chatterjee:
Nash Equilibrium for Upward-Closed Objectives.
CSL 2006: 271-286 |
| 25 | EE | Krishnendu Chatterjee,
Laurent Doyen,
Thomas A. Henzinger,
Jean-François Raskin:
Algorithms for Omega-Regular Games with Imperfect Information, .
CSL 2006: 287-302 |
| 24 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Marco Faella,
Thomas A. Henzinger,
Rupak Majumdar,
Mariëlle Stoelinga:
Compositional Quantitative Reasoning.
QEST 2006: 179-188 |
| 23 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Thomas A. Henzinger:
Strategy Improvement for Concurrent Reachability Games.
QEST 2006: 291-300 |
| 22 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Thomas A. Henzinger:
The complexity of quantitative concurrent parity games.
SODA 2006: 678-687 |
| 21 | EE | Krishnendu Chatterjee,
Rupak Majumdar,
Thomas A. Henzinger:
Markov Decision Processes with Multiple Objectives.
STACS 2006: 325-336 |
| 20 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.
STACS 2006: 512-523 |
| 19 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Finitary Winning in omega-Regular Games.
TACAS 2006: 257-271 |
| 18 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with secure equilibria.
Theor. Comput. Sci. 365(1-2): 67-82 (2006) |
| 2005 |
|---|
| 17 | EE | Arindam Chakrabarti,
Krishnendu Chatterjee,
Thomas A. Henzinger,
Orna Kupferman,
Rupak Majumdar:
Verifying Quantitative Properties Using Bound Functions.
CHARME 2005: 50-64 |
| 16 | EE | Krishnendu Chatterjee:
Two-Player Nonzero-Sum omega-Regular Games.
CONCUR 2005: 413-427 |
| 15 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger:
Semiperfect-Information Games.
FSTTCS 2005: 1-18 |
| 14 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Thomas A. Henzinger:
The Complexity of Stochastic Rabin and Streett Games'.
ICALP 2005: 878-890 |
| 13 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Mean-Payoff Parity Games.
LICS 2005: 178-187 |
| 12 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Ranjit Jhala,
Rupak Majumdar:
Counterexample-guided Planning.
UAI 2005: 104-111 |
| 2004 |
|---|
| 11 | EE | Krishnendu Chatterjee,
Rupak Majumdar,
Marcin Jurdzinski:
On Nash Equilibria in Stochastic Games.
CSL 2004: 26-40 |
| 10 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with Secure Equilibria.
FMCO 2004: 141-161 |
| 9 | EE | Krishnendu Chatterjee,
Pallab Dasgupta,
P. P. Chakrabarti:
Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures.
IWDC 2004: 102-113 |
| 8 | EE | Krishnendu Chatterjee,
Thomas A. Henzinger,
Marcin Jurdzinski:
Games with Secure Equilibria.
LICS 2004: 160-169 |
| 7 | EE | Krishnendu Chatterjee,
Luca de Alfaro,
Thomas A. Henzinger:
Trading Memory for Randomness.
QEST 2004: 206-217 |
| 6 | EE | Krishnendu Chatterjee,
Marcin Jurdzinski,
Thomas A. Henzinger:
Quantitative stochastic parity games.
SODA 2004: 121-130 |
| 5 | EE | Krishnendu Chatterjee,
Di Ma,
Rupak Majumdar,
Tian Zhao,
Thomas A. Henzinger,
Jens Palsberg:
Stack size analysis for interrupt-driven programs.
Inf. Comput. 194(2): 144-174 (2004) |
| 4 | EE | Krishnendu Chatterjee,
Pallab Dasgupta,
P. P. Chakrabarti:
The power of first-order quantification over states in branching and linear time temporal logics.
Inf. Process. Lett. 91(5): 201-210 (2004) |
| 2003 |
|---|
| 3 | EE | Krishnendu Chatterjee,
Marcin Jurdzinski,
Thomas A. Henzinger:
Simple Stochastic Parity Games.
CSL 2003: 100-113 |
| 2 | EE | Krishnendu Chatterjee,
Di Ma,
Rupak Majumdar,
Tian Zhao,
Thomas A. Henzinger,
Jens Palsberg:
Stack Size Analysis for Interrupt-Driven Programs.
SAS 2003: 109-126 |
| 1 | | Krishnendu Chatterjee,
Pallab Dasgupta,
P. P. Chakrabarti:
A Branching Time Temporal Framework for Quantitative Reasoning.
J. Autom. Reasoning 30(2): 205-232 (2003) |
