Please note that LibreCat 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 K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 | Published | 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 | Published | 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 | Published | 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 | Published | Journal Article | IST-REx-ID: 3260 |
Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Published | Conference Paper | IST-REx-ID: 3341 |
Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Published | 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 | Published | 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 | Published | 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 | Published | 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
2012 | Published | Technical Report | IST-REx-ID: 5377 |
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2012 | Published | Technical Report | IST-REx-ID: 5378 |
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
[Published Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 10904
Chatterjee K, Randour M, Raskin J-F. 2012. Strategy synthesis for multi-dimensional quantitative objectives. CONCUR 2012 - Concurrency Theory. CONCUR: Conference on Concurrency Theory, LNCS, vol. 7454, 115–131.
[Preprint]
View
| Files available
| DOI
| arXiv
2012 | Published | Conference Paper | IST-REx-ID: 10905 |
Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. 2012. Polynomial-time algorithms for energy games with special weight structures. Algorithms – ESA 2012. ESA: European Symposium on Algorithms, LNCS, vol. 7501, 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3315 |
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3316 |
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Preprint | IST-REx-ID: 3338 |
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 | Published | Preprint | IST-REx-ID: 3339 |
Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, .
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3342 |
Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv