Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2013). The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria.https://doi.org/10.15479/AT:IST-2013-141-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5408
DOI: 10.15479/AT:IST-2013-141-v1-1

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2013). Automatic generation of alternative starting positions for traditional board games. IST Austria.https://doi.org/10.15479/AT:IST-2013-146-v1-1 
LibreCat: https://research-explorer.ista.ac.at/record/5410
DOI: 10.15479/AT:IST-2013-146-v1-1

Chatterjee, K., &; Velner, Y. (2013). Hyperplane separation technique for multidimensional mean-payoff games. Presented at the CONCUR: Concurrency Theory, Buenos Aires, Argentinia: Springer.https://doi.org/10.1007/978-3-642-40184-8_35 
LibreCat: https://research-explorer.ista.ac.at/record/2329
DOI: 10.1007/978-3-642-40184-8_35
arXiv: 1210.3141

Zagorsky, B., Reiter, J., Chatterjee, K., &; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . Public Library of Science.https://doi.org/10.1371/journal.pone.0080814.s001 
LibreCat: https://research-explorer.ista.ac.at/record/9749
DOI: 10.1371/journal.pone.0080814.s001

Chatterjee, K., Chaubal, S., &; Rubin, S. (2013). How to travel between languages. In 7th International Conference on Language and Automata Theory and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.https://doi.org/10.1007/978-3-642-37064-9_20 
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

Zagorsky, B., Reiter, J., Chatterjee, K., &; Nowak, M. (2013). Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. Public Library of Science.https://doi.org/10.1371/journal.pone.0080814 
LibreCat: https://research-explorer.ista.ac.at/record/2247
DOI: 10.1371/journal.pone.0080814

Reiter, J., Boei, I., Allen, B., Chatterjee, K., &; Nowak, M. (2013). The effect of one additional driver mutation on tumor progression. Evolutionary Applications. Wiley-Blackwell.https://doi.org/10.1111/eva.12020 
LibreCat: https://research-explorer.ista.ac.at/record/2858
DOI: 10.1111/eva.12020

Boei, I., Reiter, J., Allen, B., Antal, T., Chatterjee, K., Shah, P.,https://doi.org/10.7554/eLife.00747__Nowak, M. (2013). Evolutionary dynamics of cancer in response to targeted combination therapy. ELife. eLife Sciences Publications.https://doi.org/10.7554/eLife.00747 
LibreCat: https://research-explorer.ista.ac.at/record/2816
DOI: 10.7554/eLife.00747

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

Chatterjee, K., &; Henzinger, M. H. (2012). An O(n2) time algorithm for alternating Büchi games. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1386–1399). Kyoto, Japan: SIAM.https://doi.org/10.1137/1.9781611973099.109 
LibreCat: https://research-explorer.ista.ac.at/record/3165
DOI: 10.1137/1.9781611973099.109
arXiv: 1109.5018

Chatterjee, K., &; Velner, Y. (2012). Mean payoff pushdown games. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE.https://doi.org/10.1109/LICS.2012.30 
LibreCat: https://research-explorer.ista.ac.at/record/2956
DOI: 10.1109/LICS.2012.30

Chatterjee, K., &; Velner, Y. (2012). Mean-payoff pushdown games. IST Austria.https://doi.org/10.15479/AT:IST-2012-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5377
DOI: 10.15479/AT:IST-2012-0002

Chatterjee, K., Chaubal, S., &; Kamath, P. (2012). Faster algorithms for alternating refinement relations. IST Austria.https://doi.org/10.15479/AT:IST-2012-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5378
DOI: 10.15479/AT:IST-2012-0001

Chatterjee, K., &; Doyen, L. (2012). Partial-observation stochastic games: How to win when belief fails. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia: IEEE.https://doi.org/10.1109/LICS.2012.28 
LibreCat: https://research-explorer.ista.ac.at/record/2955
DOI: 10.1109/LICS.2012.28
arXiv: 1107.2141

Chatterjee, K. (2012). Robustness of structurally equivalent concurrent parity games (Vol. 7213, pp. 270–285). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia: Springer.https://doi.org/10.1007/978-3-642-28729-9_18 
LibreCat: https://research-explorer.ista.ac.at/record/3341
DOI: 10.1007/978-3-642-28729-9_18
arXiv: 1107.2009

Chatterjee, K., &; Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. Dubrovnik, Croatia : IEEE.https://doi.org/10.1109/LICS.2012.29 
LibreCat: https://research-explorer.ista.ac.at/record/2957
DOI: 10.1109/LICS.2012.29
arXiv: 1107.2091

Chatterjee, K., Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2012). Polynomial-time algorithms for energy games with special weight structures. In Algorithms – ESA 2012 (Vol. 7501, pp. 301–312). Ljubljana, Slovenia: Springer.https://doi.org/10.1007/978-3-642-33090-2_27 
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

Diaz Jr, L., Williams, R., Wu, J., Kinde, I., Hecht, J., Berlin, J.,https://doi.org/10.1038/nature11219__Vogelstein, B. (2012). The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. Nature Publishing Group.https://doi.org/10.1038/nature11219 
LibreCat: https://research-explorer.ista.ac.at/record/3157
DOI: 10.1038/nature11219
PMID: 22722843

Chatterjee, K., Reiter, J., &; Nowak, M. (2012). Evolutionary dynamics of biological auctions. Theoretical Population Biology. Academic Press.https://doi.org/10.1016/j.tpb.2011.11.003 
LibreCat: https://research-explorer.ista.ac.at/record/3260
DOI: 10.1016/j.tpb.2011.11.003
PMID: 22120126

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &; Jobstmann, B. (2011). Specification-centered robustness. In 6th IEEE International Symposium on Industrial and Embedded Systems (pp. 176–185). Vasteras, Sweden: IEEE.https://doi.org/10.1109/SIES.2011.5953660 
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 10.1109/SIES.2011.5953660

Chatterjee, K., &; Majumdar, R. (2011). Minimum attention controller synthesis for omega regular objectives. In U. Fahrenberg &; S. Tripakis (Eds.) (Vol. 6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark: Springer.https://doi.org/10.1007/978-3-642-24310-3_11 
LibreCat: https://research-explorer.ista.ac.at/record/3350
DOI: 10.1007/978-3-642-24310-3_11

Chatterjee, K., Doyen, L., &; Singh, R. (2011). On memoryless quantitative objectives. In O. Owe, M. Steffen, &; J. A. Telle (Eds.) (Vol. 6914, pp. 148–159). Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer.https://doi.org/10.1007/978-3-642-22953-4_13 
LibreCat: https://research-explorer.ista.ac.at/record/3351
DOI: 10.1007/978-3-642-22953-4_13

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2011). Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/1970398.1970404 
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

Chatterjee, K., &; Fijalkow, N. (2011). A reduction from parity games to simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS.https://doi.org/10.4204/EPTCS.54.6 
LibreCat: https://research-explorer.ista.ac.at/record/3349
DOI: 10.4204/EPTCS.54.6

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer.https://doi.org/10.1007/978-3-642-19835-9_24 
LibreCat: https://research-explorer.ista.ac.at/record/3365
DOI: 10.1007/978-3-642-19835-9_24

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-7(4:8)2011 
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

Chatterjee, K., De Alfaro, L., &; Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3339
arXiv: 1107.2132

Chatterjee, K., Henzinger, M. H., Joglekar, M., &; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer.https://doi.org/10.1007/978-3-642-22110-1_21 
LibreCat: https://research-explorer.ista.ac.at/record/3342
DOI: 10.1007/978-3-642-22110-1_21
arXiv: 1104.3348

Chatterjee, K., &; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_16 
LibreCat: https://research-explorer.ista.ac.at/record/3347
DOI: 10.1007/978-3-642-21254-3_16
arXiv: 1101.1727

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.10 
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

Chatterjee, K., &; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer.https://doi.org/10.1145/1967701.1967734 
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734

Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno &; I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer.https://doi.org/10.1007/978-3-642-24288-5_1 
LibreCat: https://research-explorer.ista.ac.at/record/3344
DOI: 10.1007/978-3-642-24288-5_1

Chatterjee, K., &; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM.https://doi.org/10.1137/1.9781611973082.101 
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101

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

Chatterjee, K., &; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at thehttps://doi.org/10.1007/978-3-642-14162-1_50__ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer.https://doi.org/10.1007/978-3-642-14162-1_50 
LibreCat: https://research-explorer.ista.ac.at/record/3851
DOI: 10.1007/978-3-642-14162-1_50
arXiv: 1001.5183

Chatterjee, K., Doyen, L., Henzinger, T. A., &; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-642-14295-6_34 
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

Chatterjee, K., De Alfaro, L., Raman, V., &; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum &; G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer.https://doi.org/10.1007/978-3-642-12029-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/3865
DOI: 10.1007/978-3-642-12029-9_21

Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.09.006 
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006

Chatterjee, K., Henzinger, T. A., &; Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.07.004 
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-6(3:10)2010 
LibreCat: https://research-explorer.ista.ac.at/record/3867
DOI: 10.2168/LMCS-6(3:10)2010

Cristau, J., David, C., &; Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association.https://doi.org/10.4204/EPTCS.25.7 
LibreCat: https://research-explorer.ista.ac.at/record/489
DOI: 10.4204/EPTCS.25.7

Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria.https://doi.org/10.15479/AT:IST-2010-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_57 
LibreCat: https://research-explorer.ista.ac.at/record/4388
DOI: 10.1007/978-3-642-14295-6_57
arXiv: 1004.2367

Chatterjee, K., &; Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria.https://doi.org/10.15479/AT:IST-2010-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5390
DOI: 10.15479/AT:IST-2010-0002

Chatterjee, K., &; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer.https://doi.org/10.1007/978-3-642-15643-4_1 
LibreCat: https://research-explorer.ista.ac.at/record/3857
DOI: 10.1007/978-3-642-15643-4_1

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_24 
LibreCat: https://research-explorer.ista.ac.at/record/3855
DOI: 10.1007/978-3-642-15155-2_24

Chatterjee, K., &; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS.https://doi.org/10.4204/EPTCS.25.6 
LibreCat: https://research-explorer.ista.ac.at/record/3852
DOI: 10.4204/EPTCS.25.6
arXiv: 1006.1403

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer.https://doi.org/10.1007/978-3-642-04081-8_17 
LibreCat: https://research-explorer.ista.ac.at/record/3871
DOI: 10.1007/978-3-642-04081-8_17

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/1614431.1614432 
LibreCat: https://research-explorer.ista.ac.at/record/3870
DOI: 10.1145/1614431.1614432

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer.https://doi.org/10.1007/978-3-642-03409-1_2 
LibreCat: https://research-explorer.ista.ac.at/record/4542
DOI: 10.1007/978-3-642-03409-1_2

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer.https://doi.org/10.1007/978-3-642-02930-1_1 
LibreCat: https://research-explorer.ista.ac.at/record/4545
DOI: 10.1007/978-3-642-02930-1_1

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer.https://doi.org/10.1007/978-3-642-03816-7_4 
LibreCat: https://research-explorer.ista.ac.at/record/4543
DOI: 10.1007/978-3-642-03816-7_4

Bloem, R., Chatterjee, K., Henzinger, T. A., &; Jobstmann, B. (2009). Better quality in synthesis through quantitative objectives (Vol. 5643, pp. 140–156). Presented at the CAV: Computer Aided Verification, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-02658-4_14 
LibreCat: https://research-explorer.ista.ac.at/record/4569
DOI: 10.1007/978-3-642-02658-4_14
arXiv: 0904.2638

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2009). Gist: A solver for probabilistic games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0003 
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2009). Improved lower bounds for request-response and finitary Streett games. IST Austria.https://doi.org/10.15479/AT:IST-2009-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002

Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria.https://doi.org/10.15479/AT:IST-2009-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5392
DOI: 10.15479/AT:IST-2009-0004

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2009-0001 
LibreCat: https://research-explorer.ista.ac.at/record/5395
DOI: 10.15479/AT:IST-2009-0001