Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/978-3-642-33090-2_27__In Algorithms – ESA 2012, 7501:301–12. Springer, 2012.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, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.”https://doi.org/10.1038/nature11219__Nature. Nature Publishing Group, 2012.https://doi.org/10.1038/nature11219 .
LibreCat: https://research-explorer.ista.ac.at/record/3157
DOI: 10.1038/nature11219
PMID: 22722843

Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.”https://doi.org/10.1016/j.tpb.2011.11.003__Theoretical Population Biology. Academic Press, 2012.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, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .
LibreCat: https://research-explorer.ista.ac.at/record/3316
DOI: 10.1109/SIES.2011.5953660

Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.”https://doi.org/10.1007/978-3-642-24310-3_11__edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011.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, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.”https://doi.org/10.1007/978-3-642-22953-4_13__edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011.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, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .
LibreCat: https://research-explorer.ista.ac.at/record/3354
DOI: 10.1145/1970398.1970404

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,”https://doi.org/10.4204/EPTCS.54.6__54:74–86. EPTCS, 2011.https://doi.org/10.4204/EPTCS.54.6 .
LibreCat: https://research-explorer.ista.ac.at/record/3349
DOI: 10.4204/EPTCS.54.6

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.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, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.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, Krishnendu, Luca De Alfaro, and Roy 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

Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1007/978-3-642-22110-1_21__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011.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, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,”https://doi.org/10.1007/978-3-642-21254-3_16__6638:216–26. Springer, 2011.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, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2011.10__IEEE, 2011.https://doi.org/10.1109/LICS.2011.10 .
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,”https://doi.org/10.1145/1967701.1967734__221–30. Springer, 2011.https://doi.org/10.1145/1967701.1967734 .
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734

Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.”https://doi.org/10.1007/978-3-642-24288-5_1__edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011.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, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,”https://doi.org/10.1137/1.9781611973082.101__1318–36. SIAM, 2011.https://doi.org/10.1137/1.9781611973082.101 .
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.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