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, 10.1371/journal.pcbi.1003818.s001.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2162 | 
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Conference Paper | IST-REx-ID: 2163 |
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573, 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Technical Report | IST-REx-ID: 5418 |
Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2213 |
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[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. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 475 |
Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.
[Published Version]
View
| Files available
| DOI
| arXiv
2014 | Published | Technical Report | IST-REx-ID: 5412 |
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5414 |
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5413 |
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
View
| Files available
| DOI
2014 | Published | Journal Article | IST-REx-ID: 2038 |
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[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. CAV: Computer Aided Verification, LNCS, vol. 8559, 473–490.
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2053 |
Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Conference Paper | IST-REx-ID: 2027 |
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Conference Paper | IST-REx-ID: 2190 |
Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 1733 |
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 2246 |
Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Technical Report | IST-REx-ID: 5428 |
Chatterjee K, Henzinger TA, Otop J, Velner Y. 2014. Quantitative fair simulation games, IST Austria, 26p.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 1903 |
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)