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

G. Tkadik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” PLoS One, vol. 9, no. 1. Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/3263
DOI: 10.1371/journal.pone.0085841

K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp. 397–428, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2852
DOI: 10.1007/s00145-013-9148-7

A. Cimadom et al., “Invasive parasites habitat change and heavy rainfall reduce breeding success in Darwin’s finches,” PLoS One, vol. 9, no. 9. Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/468
DOI: 10.1371/journal.pone.0107518

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

T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.
LibreCat: https://research-explorer.ista.ac.at/record/10892
DOI: 10.1007/978-3-319-13075-0_10

R. Prizak, T. Ezard, and R. Hoyle, “Fitness consequences of maternal and grandmaternal effects,” Ecology and Evolution, vol. 4, no. 15. Wiley-Blackwell, pp. 3139–3145, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/537
DOI: 10.1002/ece3.1150

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

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

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

K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

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

P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, Compositional specifications for IOCO testing. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5411
DOI: 10.15479/AT:IST-2014-148-v2-1

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

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

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

K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
LibreCat: https://research-explorer.ista.ac.at/record/2163
DOI: 10.1007/978-3-662-43951-7_10
arXiv: 1404.5453