P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.

K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.

K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.

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

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

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

K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.

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

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

P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.

K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.

K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.

K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.

K. Chatterjee and T. A. Henzinger, Eds., Formal modeling and analysis of timed systems, vol. 6246. Springer, 2010.

R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Robustness in the presence of liveness,” presented at the CAV: Computer Aided Verification, Edinburgh, UK, 2010, vol. 6174, pp. 410–424.

K. Chatterjee, L. De Alfaro, R. Majumdar, and V. Raman, “Algorithms for game metrics,” Logical Methods in Computer Science, vol. 6, no. 3. International Federation of Computational Logic, pp. 1–27, 2010.

K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.

K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.