Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .
LibreCat: https://research-explorer.ista.ac.at/record/2936
DOI: 10.1145/2380356.2380370

Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,”https://doi.org/10.1007/978-3-642-33386-6_30__7561:385–99. Springer, 2012.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, Brázdil, Krishnendu Chatterjee, Antonín Kudera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,”https://doi.org/10.1007/978-3-642-31424-7_8__7358:23–38. Springer, 2012.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, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,”https://doi.org/10.1007/978-3-642-27940-9_11__7148:152–68. Springer, 2012.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, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,”https://doi.org/10.1007/978-3-642-25929-6_3__7119:37–46. Springer, 2012.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, Krishnendu. “The Complexity of Stochastic Müller Games.”https://doi.org/10.1016/j.ic.2011.11.004__Information and Computation. Elsevier, 2012.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, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.”https://doi.org/10.1142/S0129054112400308__International Journal of Foundations of Computer Science. World Scientific Publishing, 2012.https://doi.org/10.1142/S0129054112400308 .
LibreCat: https://research-explorer.ista.ac.at/record/3314
DOI: 10.1142/S0129054112400308

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.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, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.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, Krishnendu, and Laurent Doyen. “Energy Parity Games.”https://doi.org/10.1016/j.tcs.2012.07.038__Theoretical Computer Science. Elsevier, 2012.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, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.”https://doi.org/10.4204/EPTCS.96.18__In Proceedings GandALF 2012, 96:238–46. Open Publishing Association, 2012.https://doi.org/10.4204/EPTCS.96.18 .
LibreCat: https://research-explorer.ista.ac.at/record/495
DOI: 10.4204/EPTCS.96.18

Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.”https://doi.org/10.1109/LICS.2012.65__IEEE, 2012.https://doi.org/10.1109/LICS.2012.65 .
LibreCat: https://research-explorer.ista.ac.at/record/496
DOI: 10.1109/LICS.2012.65

Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,”https://doi.org/10.4230/LIPIcs.CSL.2012.167__16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.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, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.”https://doi.org/10.1137/1.9781611973099.109__In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012.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, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”https://doi.org/10.1109/LICS.2012.30__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.30 .
LibreCat: https://research-explorer.ista.ac.at/record/2956
DOI: 10.1109/LICS.2012.30

Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012.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, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012.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, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”https://doi.org/10.1109/LICS.2012.28__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.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, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,”https://doi.org/10.1007/978-3-642-28729-9_18__7213:270–85. Springer, 2012.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, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.”https://doi.org/10.1109/LICS.2012.29__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.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