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 K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148, 152–168.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3255 |
Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119, 37–46.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.
View
| DOI
| Download None (ext.)
2012 | Journal Article | IST-REx-ID: 3846 |
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Journal Article | IST-REx-ID: 3128 |
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 2972 |
Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
[Published Version]
View
| Files available
| DOI
| arXiv
2012 | Conference Paper | IST-REx-ID: 495 |
Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 496 |
Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 497 |
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.
[Published Version]
View
| Files available
| DOI