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.
464 Publications
2012 | Journal Article | IST-REx-ID: 3128 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 3165 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2955 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 3341 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 2957 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10905 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
2012 | Journal Article | IST-REx-ID: 3157 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Journal Article | IST-REx-ID: 3260 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
2011 | Conference Paper | IST-REx-ID: 3316 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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 | Conference Paper | IST-REx-ID: 3351 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3349 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)