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.

499 Publications


2014 | Research Data Reference | IST-REx-ID: 9739
Chatterjee, K., Pavlogiannis, A., Adlam, B., & Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.” Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003818.s001
[Published Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 2162 | OA
Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_11
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 2163 | OA
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer. https://doi.org/10.1007/978-3-662-43951-7_10
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Published | Technical Report | IST-REx-ID: 5418 | OA
Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. IST Austria. https://doi.org/10.15479/AT:IST-2014-176-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 2213 | OA
Chatterjee, K., Doyen, L., Nain, S., & Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_16
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 2212
Chatterjee, K., Doyen, L., Gimbert, H., & Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer. https://doi.org/10.1007/978-3-642-54830-7_14
View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 475 | OA
Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11
[Published Version] View | Files available | DOI | arXiv
 

2014 | Published | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v3-1
[Published Version] View | Files available | DOI
 

2014 | Published | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee, K., Daca, P., & Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria. https://doi.org/10.15479/AT:IST-2014-153-v2-2
[Published Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 2054
Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_37
View | Files available | DOI
 

2014 | Published | Journal Article | IST-REx-ID: 2038 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2629686
[Submitted Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 2063
Chatterjee, K., Chmelik, M., & Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-08867-9_31
View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 2053 | OA
Hermanns, H., Krčál, J., & Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan & D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_18
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez & J.-F. Raskin (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 98–114). Sydney, Australia: Springer. https://doi.org/10.1007/978-3-319-11936-6_8
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2014 | Published | Conference Paper | IST-REx-ID: 2190 | OA
Esparza, J., & Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/978-3-319-08867-9_13
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2014 | Published | Journal Article | IST-REx-ID: 1733 | OA
Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 

2014 | Published | Journal Article | IST-REx-ID: 2246 | OA
Grinshpun, A., Phalitnonkiat, P., Rubin, S., & Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2013.11.032
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 

2014 | Published | Technical Report | IST-REx-ID: 5428 | OA
Chatterjee, K., Henzinger, T. A., Otop, J., & Velner, Y. (2014). Quantitative fair simulation games. IST Austria. https://doi.org/10.15479/AT:IST-2014-315-v1-1
[Published Version] View | Files available | DOI
 

2014 | Published | Conference Paper | IST-REx-ID: 1903 | OA
Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer. https://doi.org/10.1007/978-3-662-44522-8_1
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed