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.

489 Publications


2012 | Published | Conference Paper | IST-REx-ID: 497 | OA
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 | Journal Article | IST-REx-ID: 3260 | OA
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
 

2012 | Published | Technical Report | IST-REx-ID: 5378 | OA
K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 | Published | Journal Article | IST-REx-ID: 2972 | OA
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 | 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 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee, Krishnendu, Equivalence of games with probabilistic uncertainty and partial observation games. 7561. 2012
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2012 | Published | Technical Report | IST-REx-ID: 5377 | OA
K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.
[Published Version] View | Files available | DOI
 

2012 | Published | 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 | Published | Conference Paper | IST-REx-ID: 2955 | OA
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 | Journal Article | IST-REx-ID: 3314
K. Chatterjee and R. Majumdar, “Discounting and averaging in games across time scales,” International Journal of Foundations of Computer Science, vol. 23, no. 3. World Scientific Publishing, pp. 609–625, 2012.
View | DOI
 

2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

2011 | Published | Preprint | IST-REx-ID: 3338 | OA
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Published | Preprint | IST-REx-ID: 3339 | OA
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
 

2011 | Published | Conference Paper | IST-REx-ID: 3343 | OA
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3365 | OA
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 | Published | Journal Article | IST-REx-ID: 3315 | OA
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 | Technical Report | IST-REx-ID: 5379 | OA
K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

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 | Technical Report | IST-REx-ID: 5384 | OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed