Cerny, P., Chatterjee, K., &; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE.https://doi.org/10.1109/CSF.2011.21 
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_17 
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Chatterjee, K., &; Henzinger, M. H. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0009 
LibreCat: https://research-explorer.ista.ac.at/record/5379
DOI: 10.15479/AT:IST-2011-0009

Chatterjee, K., &; Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria.https://doi.org/10.15479/AT:IST-2011-0007 
LibreCat: https://research-explorer.ista.ac.at/record/5381
DOI: 10.15479/AT:IST-2011-0007

Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0008 
LibreCat: https://research-explorer.ista.ac.at/record/5380
DOI: 10.15479/AT:IST-2011-0008

Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria.https://doi.org/10.15479/AT:IST-2011-0006 
LibreCat: https://research-explorer.ista.ac.at/record/5382
DOI: 10.15479/AT:IST-2011-0006

Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3338
arXiv: 1107.2146

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.33 
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria.https://doi.org/10.15479/AT:IST-2011-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Chatterjee, K., &; Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria.https://doi.org/10.15479/AT:IST-2011-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5384
DOI: 10.15479/AT:IST-2011-0004

Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan &; S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer.https://doi.org/10.1007/978-3-642-22110-1_20 
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

Chatterjee, K., &; Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer.https://doi.org/10.1007/978-3-642-22993-0_21 
LibreCat: https://research-explorer.ista.ac.at/record/3345
DOI: 10.1007/978-3-642-22993-0_21
arXiv: 1104.2909

Chatterjee, K., &; Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2011-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5387
DOI: 10.15479/AT:IST-2011-0001

Chatterjee, K., &; Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer.https://doi.org/10.1007/978-3-642-16242-8_1 
LibreCat: https://research-explorer.ista.ac.at/record/3858
DOI: 10.1007/978-3-642-16242-8_1

Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_23 
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

Chatterjee, K., &; Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-15297-9 
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_36 
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Chatterjee, K., De Alfaro, L., Majumdar, R., &; Raman, V. (2010). Algorithms for game metrics. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-6(3:13)2010 
LibreCat: https://research-explorer.ista.ac.at/record/3868
DOI: 10.2168/LMCS-6(3:13)2010

Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

Chatterjee, K., Horn, F., &; Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_20 
LibreCat: https://research-explorer.ista.ac.at/record/3854
DOI: 10.1007/978-3-642-15375-4_20