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 | Journal Article | IST-REx-ID: 2848 | 
K. Chatterjee, D. Zufferey, and M. Nowak, “Evolutionary game dynamics in populations with different learners,” Journal of Theoretical Biology, vol. 301. Elsevier, pp. 161–173, 2012.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2012 | Conference Paper | IST-REx-ID: 2916 |
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 2936 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in roceedings of the tenth ACM international conference on Embedded software, Tampere, Finland, 2012, pp. 43–52.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 2947 |
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3135 |
B. Brázdil, K. Chatterjee, A. Kučera, and P. Novotný, “Efficient controller synthesis for consumption games with multiple resource types,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 23–38.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3252 |
K. Chatterjee and V. Raman, “Synthesizing protocols for digital contract signing,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 152–168.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 3255 |
K. Chatterjee and L. Doyen, “Games and Markov decision processes with mean payoff parity and energy parity objectives,” presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Lednice, Czech Republic, 2012, vol. 7119, pp. 37–46.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 3254
K. Chatterjee, “The complexity of stochastic Müller games,” Information and Computation, vol. 211. Elsevier, pp. 29–48, 2012.
View
| DOI
| Download None (ext.)
2012 | Journal Article | IST-REx-ID: 3846 |
K. Chatterjee and T. A. Henzinger, “A survey of stochastic ω regular games,” Journal of Computer and System Sciences, vol. 78, no. 2. Elsevier, pp. 394–413, 2012.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2012 | Journal Article | IST-REx-ID: 3128 |
K. Chatterjee, L. Doyen, and T. A. Henzinger, “A survey of partial-observation stochastic parity games,” Formal Methods in System Design, vol. 43, no. 2. Springer, pp. 268–284, 2012.
[Submitted Version]
View
| Files available
| DOI
2012 | Journal Article | IST-REx-ID: 2972 |
K. Chatterjee and L. Doyen, “Energy parity games,” Theoretical Computer Science, vol. 458. Elsevier, pp. 49–60, 2012.
[Published Version]
View
| Files available
| DOI
| arXiv
2012 | Conference Paper | IST-REx-ID: 495 |
A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 496 |
A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Conference Paper | IST-REx-ID: 497 |
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 | Conference Paper | IST-REx-ID: 3165 |
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 | 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 | Technical Report | IST-REx-ID: 5377 |
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Technical Report | IST-REx-ID: 5378 |
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
[Published Version]
View
| Files available
| DOI
2012 | Conference Paper | IST-REx-ID: 2955 |
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