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.
470 Publications
2012 |Published| Conference Paper | IST-REx-ID: 497 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 3165 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View
| Files available
| DOI
| Download None (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2956
K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 |Published| Technical Report | IST-REx-ID: 5378 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 |Published| Conference Paper | IST-REx-ID: 2955 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 3341 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 2957 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Conference Paper | IST-REx-ID: 10905 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 |Published| Journal Article | IST-REx-ID: 3157 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
L. Diaz Jr et al., “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 |Published| Journal Article | IST-REx-ID: 3260 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2011 |Published| Conference Paper | IST-REx-ID: 3316 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3351 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3349 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3365 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
[Submitted Version]
View
| Files available
| DOI
2011 |Submitted| Preprint | IST-REx-ID: 3363 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 |Published| Journal Article | IST-REx-ID: 3315 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3339 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.
[Preprint]
View
| Download Preprint (ext.)
| arXiv