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

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

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.

Finitary languages
K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.

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

Synthesis of memory efficient real time controllers for safety objectives
K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.

Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.

Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.

The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.

The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.

An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M.H. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.

Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.

Bounded rationality in concurrent parity games
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.

Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.

Bounded rationality in concurrent parity games
K. Chatterjee, ArXiv (2011) 1–51.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.

Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.

Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.

Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.