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
2014 | 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. Elsevier. https://doi.org/10.1016/j.tcs.2013.11.032
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 | Journal Article | IST-REx-ID: 2716 |
Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer. https://doi.org/10.1007/s00236-013-0182-6
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Journal Article | IST-REx-ID: 1733 |
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.)
2014 | Journal Article | IST-REx-ID: 2141 |
Chatterjee, K., & Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM. https://doi.org/10.1145/2597631
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 | 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 | Conference Paper | IST-REx-ID: 475 |
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
2014 | Conference Paper | IST-REx-ID: 1903
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
View
| Files available
| DOI
2014 | Journal Article | IST-REx-ID: 2211 |
Chatterjee, K., & Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM. https://doi.org/10.1145/2579821
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Journal Article | IST-REx-ID: 2038 |
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 | Conference Paper | IST-REx-ID: 2162 |
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