Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.
LibreCat: https://research-explorer.ista.ac.at/record/2246
DOI: 10.1016/j.tcs.2013.11.032

Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
LibreCat: https://research-explorer.ista.ac.at/record/2716
DOI: 10.1007/s00236-013-0182-6
arXiv: 1201.5073

Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), .
LibreCat: https://research-explorer.ista.ac.at/record/2141
DOI: 10.1145/2597631

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.
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 10.4204/EPTCS.146.11

Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 10.1007/978-3-662-44522-8_1

Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
LibreCat: https://research-explorer.ista.ac.at/record/2211
DOI: 10.1145/2579821
arXiv: 1107.2141

Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 10.1145/2629686

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.
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

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.
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

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.
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 10.1145/2562059.2562141

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 10.15479/AT:IST-2014-153-v2-2

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 10.15479/AT:IST-2014-153-v3-1

Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 10.15479/AT:IST-2014-153-v1-1

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.
LibreCat: https://research-explorer.ista.ac.at/record/2163
DOI: 10.1007/978-3-662-43951-7_10
arXiv: 1404.5453

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
LibreCat: https://research-explorer.ista.ac.at/record/5419
DOI: 10.15479/AT:IST-2014-187-v1-1

Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
LibreCat: https://research-explorer.ista.ac.at/record/5418
DOI: 10.15479/AT:IST-2014-176-v1-1

Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
LibreCat: https://research-explorer.ista.ac.at/record/5420
DOI: 10.15479/AT:IST-2014-191-v1-1