Cerny, Pavol, et al. Quantitative Synthesis for Concurrent Programs. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 243–59, doi:10.1007/978-3-642-22110-1_20.

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011, doi:10.15479/AT:IST-2011-0001.

Chatterjee, Krishnendu, and Laurent Doyen. The Complexity of Partial-Observation Parity Games. Vol. 6397, Springer, 2010, pp. 1–14, doi:10.1007/978-3-642-16242-8_1.

Chatterjee, Krishnendu, et al. Randomness for Free. Vol. 6281, Springer, 2010, pp. 246–57, doi:10.1007/978-3-642-15155-2_23.

Chatterjee, Krishnendu, and Thomas A. Henzinger, editors. Formal Modeling and Analysis of Timed Systems. Vol. 6246, Springer, 2010, doi:10.1007/978-3-642-15297-9.

Bloem, Roderick, et al. Robustness in the Presence of Liveness. Edited by Tayssir Touili et al., vol. 6174, Springer, 2010, pp. 410–24, doi:10.1007/978-3-642-14295-6_36.

Chatterjee, Krishnendu, et al. “Algorithms for Game Metrics.”10.2168/LMCS-6(3:13)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–27, doi:10.2168/LMCS-6(3:13)2010.

Chatterjee, Krishnendu, et al. Mean-Payoff Automaton Expressions. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–83, doi:10.1007/978-3-642-15375-4_19.

Chatterjee, Krishnendu, et al. Obliging Games. Vol. 6269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–96, doi:10.1007/978-3-642-15375-4_20.

Chatterjee, Krishnendu, and Laurent Doyen. Energy Parity Games. Vol. 6199, Springer, 2010, pp. 599–610, doi:10.1007/978-3-642-14162-1_50.

Chatterjee, Krishnendu, et al. Generalized Mean-Payoff and Energy Games. Vol. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–16, doi:10.4230/LIPIcs.FSTTCS.2010.505.

Chatterjee, Krishnendu, et al. Measuring and Synthesizing Systems in Probabilistic Environments. Vol. 6174, Springer, 2010, pp. 380–95, doi:10.1007/978-3-642-14295-6_34.

Chatterjee, Krishnendu, et al. Analyzing the Impact of Change in Multi-Threaded Programs. Edited by David Rosenblum and Gabriele Taenzer, vol. 6013, Springer, 2010, pp. 293–307, doi:10.1007/978-3-642-12029-9_21.

Berwanger, Dietmar, et al. “Strategy Construction for Parity Games with Imperfect Information.”10.1016/j.ic.2009.09.006__Information and Computation, vol. 208, no. 10, Elsevier, 2010, pp. 1206–20, doi:10.1016/j.ic.2009.09.006.

Chatterjee, Krishnendu, et al. “Strategy Logic.”10.1016/j.ic.2009.07.004__Information and Computation, vol. 208, no. 6, Elsevier, 2010, pp. 677–93, doi:10.1016/j.ic.2009.07.004.

Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.”10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science, vol. 6, no. 3, International Federation of Computational Logic, 2010, pp. 1–23, doi:10.2168/LMCS-6(3:10)2010.

Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies? .”10.4204/EPTCS.25.7__Proceedings of GandALF 2010, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:10.4204/EPTCS.25.7.

Chatterjee, Krishnendu, et al. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010, doi:10.15479/AT:IST-2010-0004.

Chatterjee, Krishnendu, et al. GIST: A Solver for Probabilistic Games. Vol. 6174, Springer, 2010, pp. 665–69, doi:10.1007/978-3-642-14295-6_57.