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

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

Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0009 .
LibreCat: https://research-explorer.ista.ac.at/record/5379
DOI: 10.15479/AT:IST-2011-0009

Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0007 .
LibreCat: https://research-explorer.ista.ac.at/record/5381
DOI: 10.15479/AT:IST-2011-0007

Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0008 .
LibreCat: https://research-explorer.ista.ac.at/record/5380
DOI: 10.15479/AT:IST-2011-0008

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0006 .
LibreCat: https://research-explorer.ista.ac.at/record/5382
DOI: 10.15479/AT:IST-2011-0006

Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3338
arXiv: 1107.2146

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1109/LICS.2011.33__IEEE, 2011.https://doi.org/10.1109/LICS.2011.33 .
LibreCat: https://research-explorer.ista.ac.at/record/3356
DOI: 10.1109/LICS.2011.33

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0003 .
LibreCat: https://research-explorer.ista.ac.at/record/5385
DOI: 10.15479/AT:IST-2011-0003

Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0004 .
LibreCat: https://research-explorer.ista.ac.at/record/5384
DOI: 10.15479/AT:IST-2011-0004

Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.”https://doi.org/10.1007/978-3-642-22110-1_20__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_20 .
LibreCat: https://research-explorer.ista.ac.at/record/3366
DOI: 10.1007/978-3-642-22110-1_20

Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,”https://doi.org/10.1007/978-3-642-22993-0_21__6907:206–18. Springer, 2011.https://doi.org/10.1007/978-3-642-22993-0_21 .
LibreCat: https://research-explorer.ista.ac.at/record/3345
DOI: 10.1007/978-3-642-22993-0_21
arXiv: 1104.2909

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0001 .
LibreCat: https://research-explorer.ista.ac.at/record/5387
DOI: 10.15479/AT:IST-2011-0001

Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,”https://doi.org/10.1007/978-3-642-16242-8_1__6397:1–14. Springer, 2010.https://doi.org/10.1007/978-3-642-16242-8_1 .
LibreCat: https://research-explorer.ista.ac.at/record/3858
DOI: 10.1007/978-3-642-16242-8_1

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,”https://doi.org/10.1007/978-3-642-15155-2_23__6281:246–57. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_23 .
LibreCat: https://research-explorer.ista.ac.at/record/3856
DOI: 10.1007/978-3-642-15155-2_23

Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9 .
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.”https://doi.org/10.1007/978-3-642-14295-6_36__edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_36 .
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.”https://doi.org/10.2168/LMCS-6(3:13)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:13)2010 .
LibreCat: https://research-explorer.ista.ac.at/record/3868
DOI: 10.2168/LMCS-6(3:13)2010

Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,”https://doi.org/10.1007/978-3-642-15375-4_20__6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_20 .
LibreCat: https://research-explorer.ista.ac.at/record/3854
DOI: 10.1007/978-3-642-15375-4_20