Reiter, Johannes, et al. “TTP: Tool for Tumor Progression.”10.1007/978-3-642-39799-8_6__Proceedings of 25th Int. Conf. on Computer Aided Verification, vol. 8044, Springer, 2013, pp. 101–06, doi:10.1007/978-3-642-39799-8_6.

Brázdil, Tomás, et al. “Trading Performance for Stability in Markov Decision Processes.”10.1109/LICS.2013.39__28th Annual ACM/IEEE Symposium, IEEE, 2013, pp. 331–40, doi:10.1109/LICS.2013.39.

Chatterjee, Krishnendu, et al. “Automated Analysis of Real-Time Scheduling Using Graph Games.”10.1145/2461328.2461356__Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–72, doi:10.1145/2461328.2461356.

Chatterjee, Krishnendu, et al. Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. Vol. 18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–73, doi:10.4230/LIPIcs.FSTTCS.2012.461.

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/978-3-642-32940-1_10__CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.

Chatterjee, Krishnendu, et al. “Evolutionary Game Dynamics in Populations with Different Learners.”10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology, vol. 301, Elsevier, 2012, pp. 161–73, doi:10.1016/j.jtbi.2012.02.021.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.4204/EPTCS.96.3__Electronic Proceedings in Theoretical Computer Science, vol. 96, EPTCS, 2012, pp. 29–42, doi:10.4204/EPTCS.96.3.

Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.”10.1145/2380356.2380370__Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52, doi:10.1145/2380356.2380370.

Chatterjee, Krishnendu, et al. Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games. Vol. 7561, Springer, 2012, pp. 385–99, doi:10.1007/978-3-642-33386-6_30.

Brázdil, Brázdil, et al. Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. Vol. 7358, Springer, 2012, pp. 23–38, doi:10.1007/978-3-642-31424-7_8.

Chatterjee, Krishnendu, and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. Vol. 7148, Springer, 2012, pp. 152–68, 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. Vol. 7119, Springer, 2012, pp. 37–46, doi:10.1007/978-3-642-25929-6_3.

Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.”10.1016/j.ic.2011.11.004__Information and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.”10.1142/S0129054112400308__International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.

Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic <9 Regular Games.”10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.

Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.”10.1007/s10703-012-0164-2__Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.”10.1016/j.tcs.2012.07.038__Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.

Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”10.4204/EPTCS.96.18__Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18.

Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.

Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.