Reiter, J., Boei, I., Chatterjee, K., &; Nowak, M. (2013). TTP: Tool for tumor progression. In Proceedings of 25th Int. Conf. on Computer Aided Verification (Vol. 8044, pp. 101–106). St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_6 
LibreCat: https://research-explorer.ista.ac.at/record/2000
DOI: 10.1007/978-3-642-39799-8_6
arXiv: 1303.5251

Brázdil, T., Chatterjee, K., Forejt, V., &; Kudera, A. (2013). Trading performance for stability in Markov decision processes. In 28th Annual ACM/IEEE Symposium (pp. 331–340). New Orleans, LA, United States: IEEE.https://doi.org/10.1109/LICS.2013.39 
LibreCat: https://research-explorer.ista.ac.at/record/2305
DOI: 10.1109/LICS.2013.39
arXiv: 1305.4103

Chatterjee, K., Kößler, A., &; Schmid, U. (2013). Automated analysis of real-time scheduling using graph games. In Proceedings of the 16th International conference on Hybrid systems: Computation and control (pp. 163–172). Philadelphia, PA, United States: ACM.https://doi.org/10.1145/2461328.2461356 
LibreCat: https://research-explorer.ista.ac.at/record/2820
DOI: 10.1145/2461328.2461356

Chatterjee, K., Joglekar, M., &; Shah, N. (2012). Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Vol. 18, pp. 461–473). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461 
LibreCat: https://research-explorer.ista.ac.at/record/2715
DOI: 10.4230/LIPIcs.FSTTCS.2012.461

Chatterjee, K., Randour, M., &; Raskin, J.-F. (2012). Strategy synthesis for multi-dimensional quantitative objectives. In M. Koutny &; I. Ulidowski (Eds.), CONCUR 2012 - Concurrency Theory (Vol. 7454, pp. 115–131). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-32940-1_10 
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

Chatterjee, K., Zufferey, D., &; Nowak, M. (2012). Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2012.02.021 
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2012). Interface Simulation Distances. In Electronic Proceedings in Theoretical Computer Science (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS.https://doi.org/10.4204/EPTCS.96.3 
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2012). Finite automata with time delay blocks. In roceedings of the tenth ACM international conference on Embedded software (pp. 43–52). Tampere, Finland: ACM.https://doi.org/10.1145/2380356.2380370 
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 10.1145/2380356.2380370

Chatterjee, K., Chmelik, M., &; Majumdar, R. (2012). Equivalence of games with probabilistic uncertainty and partial observation games (Vol. 7561, pp. 385–399). Presented at thehttps://doi.org/10.1007/978-3-642-33386-6_30__ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India: Springer.https://doi.org/10.1007/978-3-642-33386-6_30 
LibreCat: https://research-explorer.ista.ac.at/record/2947
DOI: 10.1007/978-3-642-33386-6_30

Brázdil, B., Chatterjee, K., Kudera, A., &; Novotný, P. (2012). Efficient controller synthesis for consumption games with multiple resource types (Vol. 7358, pp. 23–38). Presented at the CAV: Computer Aided Verification, Berkeley, CA, USA: Springer.https://doi.org/10.1007/978-3-642-31424-7_8 
LibreCat: https://research-explorer.ista.ac.at/record/3135
DOI: 10.1007/978-3-642-31424-7_8

Chatterjee, K., &; Raman, V. (2012). Synthesizing protocols for digital contract signing (Vol. 7148, pp. 152–168). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA: Springer.https://doi.org/10.1007/978-3-642-27940-9_11 
LibreCat: https://research-explorer.ista.ac.at/record/3252
DOI: 10.1007/978-3-642-27940-9_11

Chatterjee, K., &; Doyen, L. (2012). Games and Markov decision processes with mean payoff parity and energy parity objectives (Vol. 7119, pp. 37–46). Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-25929-6_3 
LibreCat: https://research-explorer.ista.ac.at/record/3255
DOI: 10.1007/978-3-642-25929-6_3

Chatterjee, K. (2012). The complexity of stochastic Müller games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2011.11.004 
LibreCat: https://research-explorer.ista.ac.at/record/3254
DOI: 10.1016/j.ic.2011.11.004

Chatterjee, K., &; Majumdar, R. (2012). Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054112400308 
LibreCat: https://research-explorer.ista.ac.at/record/3314
DOI: 10.1142/S0129054112400308

Chatterjee, K., &; Henzinger, T. A. (2012). A survey of stochastic <9 regular games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2011.05.002 
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 10.1016/j.jcss.2011.05.002

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2012). A survey of partial-observation stochastic parity games. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0164-2 
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 10.1007/s10703-012-0164-2

Chatterjee, K., &; Doyen, L. (2012). Energy parity games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2012.07.038 
LibreCat: https://research-explorer.ista.ac.at/record/2972
DOI: 10.1016/j.tcs.2012.07.038
arXiv: 1001.5183

Kruckman, A., Rubin, S., Sheridan, J., &; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association.https://doi.org/10.4204/EPTCS.96.18 
LibreCat: https://research-explorer.ista.ac.at/record/495
DOI: 10.4204/EPTCS.96.18

Rabinovich, A., &; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia: IEEE.https://doi.org/10.1109/LICS.2012.65 
LibreCat: https://research-explorer.ista.ac.at/record/496
DOI: 10.1109/LICS.2012.65

Chatterjee, K., Chaubal, S., &; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2012.167 
LibreCat: https://research-explorer.ista.ac.at/record/497
DOI: 10.4230/LIPIcs.CSL.2012.167