K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5421
DOI: 10.15479/AT:IST-2014-190-v2-2

K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2039
DOI: 10.1371/journal.pcbi.1003818

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/9739
DOI: 10.1371/journal.pcbi.1003818.s001

K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/535
DOI: 10.1007/s00453-013-9843-7
arXiv: 1604.08234

K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 10.15479/AT:IST-2014-315-v1-1

K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
LibreCat: https://research-explorer.ista.ac.at/record/1374
DOI: 10.4230/LIPIcs.CSL.2013.181

K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2238
DOI: 10.1007/978-3-642-45221-5_17

K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
LibreCat: https://research-explorer.ista.ac.at/record/2292
DOI: 10.1007/978-3-642-40313-2

Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 10.1007/s10009-011-0207-9

K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2446
DOI: 10.1007/978-3-642-39799-8_37
arXiv: 1304.5281

K. Chatterjee and J. aCki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2444
DOI: 10.1007/978-3-642-39799-8_36
arXiv: 1304.0084

K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2814
DOI: 10.1142/S0129054113400066
arXiv: 0804.4525

S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334. Elsevier, pp. 26–34, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2817
DOI: 10.1016/j.jtbi.2013.05.029

K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
LibreCat: https://research-explorer.ista.ac.at/record/2819
DOI: 10.1145/2461328.2461370

K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229. Elsevier, pp. 83–119, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2824
DOI: 10.1016/j.ic.2013.04.003

K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4. Springer, pp. 825–859, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2836
DOI: 10.1007/s00165-013-0283-6
arXiv: 1004.2697

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 10.1016/j.jcss.2012.12.001

M. Chmelik and V. ehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2886
DOI: 10.1007/978-3-642-36046-6_12

K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” Formal Methods in System Design, vol. 42, no. 2. Springer, pp. 142–174, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/3116
DOI: 10.1007/s10703-012-0170-4

K. Chatterjee, M. H. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3. Springer, pp. 301–327, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2831
DOI: 10.1007/s10703-012-0180-2
arXiv: 1104.3348

K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2279
DOI: 10.1007/978-3-319-02444-8_10

J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5399
DOI: 10.15479/AT:IST-2013-104-v1-1

K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2295
DOI: 10.4230/LIPIcs.CSL.2013.165

K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5403
DOI: 10.15479/AT:IST-2013-126-v1-1

K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5404
DOI: 10.15479/AT:IST-2013-127-v1-1

K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5405
DOI: 10.15479/AT:IST-2013-128-v1-1

K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5409
DOI: 10.15479/AT:IST-2013-144-v1-1

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 10.1109/FMCAD.2013.6679386

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 10.15479/AT:IST-2013-130-v1-1

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

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

K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2329
DOI: 10.1007/978-3-642-40184-8_35
arXiv: 1210.3141

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

K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,” in 7th International Conference on Language and Automata Theory and Applications, Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

B. Zagorsky, J. Reiter, K. Chatterjee, and M. Nowak, “Forgiver triumphs in alternating prisoner’s dilemma ,” PLoS One, vol. 8, no. 12. Public Library of Science, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2247
DOI: 10.1371/journal.pone.0080814

J. Reiter, I. Boei, B. Allen, K. Chatterjee, and M. Nowak, “The effect of one additional driver mutation on tumor progression,” Evolutionary Applications, vol. 6, no. 1. Wiley-Blackwell, pp. 34–45, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2858
DOI: 10.1111/eva.12020

I. Boei et al., “Evolutionary dynamics of cancer in response to targeted combination therapy,” eLife, vol. 2. eLife Sciences Publications, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2816
DOI: 10.7554/eLife.00747

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

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

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

K. Chatterjee, M. Joglekar, and N. Shah, “Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives,” presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Hyderabad, India, 2012, vol. 18, pp. 461–473.
LibreCat: https://research-explorer.ista.ac.at/record/2715
DOI: 10.4230/LIPIcs.FSTTCS.2012.461

K. Chatterjee, M. Randour, and J.-F. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” in CONCUR 2012 - Concurrency Theory, Newcastle upon Tyne, United Kingdom, 2012, vol. 7454, pp. 115–131.
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2848
DOI: 10.1016/j.jtbi.2012.02.021
PMID: 22394652

P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

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

K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the  ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
LibreCat: https://research-explorer.ista.ac.at/record/2947
DOI: 10.1007/978-3-642-33386-6_30

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

K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
LibreCat: https://research-explorer.ista.ac.at/record/3252
DOI: 10.1007/978-3-642-27940-9_11

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

K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211. Elsevier, pp. 29–48, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3254
DOI: 10.1016/j.ic.2011.11.004

K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3314
DOI: 10.1142/S0129054112400308

K. Chatterjee and T. A. Henzinger, “A survey of stochastic <9 regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3846
DOI: 10.1016/j.jcss.2011.05.002

K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3128
DOI: 10.1007/s10703-012-0164-2

K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458. Elsevier, pp. 49–60, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2972
DOI: 10.1016/j.tcs.2012.07.038
arXiv: 1001.5183

A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.
LibreCat: https://research-explorer.ista.ac.at/record/495
DOI: 10.4204/EPTCS.96.18

A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/496
DOI: 10.1109/LICS.2012.65

K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
LibreCat: https://research-explorer.ista.ac.at/record/497
DOI: 10.4230/LIPIcs.CSL.2012.167

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

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

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

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

K. Chatterjee and L. Doyen, “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, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2955
DOI: 10.1109/LICS.2012.28
arXiv: 1107.2141

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

K. Chatterjee and M. Tracol, “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 , 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2957
DOI: 10.1109/LICS.2012.29
arXiv: 1107.2091

K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

L. Diaz Jr et al., “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3157
DOI: 10.1038/nature11219
PMID: 22722843

K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3260
DOI: 10.1016/j.tpb.2011.11.003
PMID: 22120126

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

K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.
LibreCat: https://research-explorer.ista.ac.at/record/3350
DOI: 10.1007/978-3-642-24310-3_11

K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
LibreCat: https://research-explorer.ista.ac.at/record/3351
DOI: 10.1007/978-3-642-22953-4_13

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
LibreCat: https://research-explorer.ista.ac.at/record/3349
DOI: 10.4204/EPTCS.54.6

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

K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

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

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

K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
LibreCat: https://research-explorer.ista.ac.at/record/3342
DOI: 10.1007/978-3-642-22110-1_21
arXiv: 1104.3348

K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
LibreCat: https://research-explorer.ista.ac.at/record/3347
DOI: 10.1007/978-3-642-21254-3_16
arXiv: 1101.1727

T. Brázdil, V. Broeek, K. Chatterjee, V. Forejt, and A. Kudera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

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

K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
LibreCat: https://research-explorer.ista.ac.at/record/3344
DOI: 10.1007/978-3-642-24288-5_1

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

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.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

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

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

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

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

K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3338
arXiv: 1107.2146

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.
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

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

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

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.
LibreCat: https://research-explorer.ista.ac.at/record/3345
DOI: 10.1007/978-3-642-22993-0_21
arXiv: 1104.2909

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

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.
LibreCat: https://research-explorer.ista.ac.at/record/3858
DOI: 10.1007/978-3-642-16242-8_1

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.
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23