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.

457 Publications


2014 | Journal Article | IST-REx-ID: 1733 | OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2141 | OA
K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2054
K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 475 | OA
B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 1903
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 2211 | OA
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 2038 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
[Submitted Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2162 | OA
K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2213 | OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2216 | OA
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Technical Report | IST-REx-ID: 5413 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5414 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5412 | OA
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2163 | OA
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5419 | OA
K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5418 | OA
K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5420 | OA
K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5424 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5426 | OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
[Published Version] View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications