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.
459 Publications
2012 | 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 | 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 | 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 | 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 | 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 | Journal Article | IST-REx-ID: 3128 |
Chatterjee, Krishnendu, et al. “A Survey of Partial-Observation Stochastic Parity Games.” Formal Methods in System Design, vol. 43, no. 2, Springer, 2012, pp. 268–84, doi:10.1007/s10703-012-0164-2.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 2972 |
Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.” Theoretical Computer Science, vol. 458, Elsevier, 2012, pp. 49–60, doi:10.1016/j.tcs.2012.07.038.
[Published Version]
View
| Files available
| DOI
| arXiv
2012 | 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 | 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 | 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