Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
454 Publications
2012 | Published | Conference Paper | IST-REx-ID: 3165 | 
Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.” Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 3252 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Published | Journal Article | IST-REx-ID: 3254
Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.” Information and Computation, vol. 211, Elsevier, 2012, pp. 29–48, doi:10.1016/j.ic.2011.11.004.
View
| DOI
| Download None (ext.)
2012 | Published | Conference Paper | IST-REx-ID: 3255 |
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.
[Submitted Version]
View
| Files available
| DOI
2012 | Published | Journal Article | IST-REx-ID: 3260 |
Chatterjee, Krishnendu, et al. “Evolutionary Dynamics of Biological Auctions.” Theoretical Population Biology, vol. 81, no. 1, Academic Press, 2012, pp. 69–80, doi:10.1016/j.tpb.2011.11.003.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Published | Journal Article | IST-REx-ID: 3314
Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.” International Journal of Foundations of Computer Science, vol. 23, no. 3, World Scientific Publishing, 2012, pp. 609–25, doi:10.1142/S0129054112400308.
View
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3341 |
Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | Journal Article | IST-REx-ID: 3846 |
Chatterjee, Krishnendu, and Thomas A. Henzinger. “A Survey of Stochastic ω Regular Games.” Journal of Computer and System Sciences, vol. 78, no. 2, Elsevier, 2012, pp. 394–413, doi:10.1016/j.jcss.2011.05.002.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Published | Conference Paper | IST-REx-ID: 495 |
Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 496 |
Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Published | Conference Paper | IST-REx-ID: 497 |
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.
[Published Version]
View
| Files available
| DOI
2012 | Published | Technical Report | IST-REx-ID: 5377 |
Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.
[Published Version]
View
| Files available
| DOI
2012 | Published | Technical Report | IST-REx-ID: 5378 |
Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 10904
Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” 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.
[Preprint]
View
| Files available
| DOI
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 10905 |
Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3315 |
Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3316 |
Bloem, Roderick, et al. “Specification-Centered Robustness.” 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–85, doi:10.1109/SIES.2011.5953660.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Preprint | IST-REx-ID: 3338 |
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv, ArXiv, 2011, pp. 1–51.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 | Published | Preprint | IST-REx-ID: 3339 |
Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3342 |
Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv