Please note that LibreCat 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 | 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
2014 | 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.
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). 15(2), 16.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | 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 | 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 | 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 | 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 | Conference Paper | IST-REx-ID: 2216 |
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 | 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 | 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 | 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 | 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 | Technical Report | IST-REx-ID: 5419 |
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
[Published Version]
View
| Files available
| DOI
2014 | 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 | Technical Report | IST-REx-ID: 5420 |
Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
[Published Version]
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5424 |
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
[Published Version]
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5426 |
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
[Published Version]
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5423 |
Chatterjee K, Kössler A, Pavlogiannis A, Schmid U. 2014. A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks, IST Austria, 14p.
[Published Version]
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5427 |
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
[Published Version]
View
| Files available
| DOI
2014 | Technical Report | IST-REx-ID: 5415 |
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
[Published Version]
View
| Files available
| DOI