Bendich P, Cabello S, Edelsbrunner H. 2012. A point calculus for interlevel set homology. Pattern Recognition Letters. 33(11), 1436–1444.
LibreCat: https://research-explorer.ista.ac.at/record/3310
DOI: 10.1016/j.patrec.2011.10.007

Ghosal A, Iercan D, Kirsch C, Henzinger TA, Sangiovanni Vincentelli A. 2012. Separate compilation of hierarchical real-time programs into linear-bounded embedded machine code. Science of Computer Programming. 77(2), 96–112.
LibreCat: https://research-explorer.ista.ac.at/record/3836
DOI: 10.1016/j.scico.2010.06.004

Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
LibreCat: https://research-explorer.ista.ac.at/record/2972
DOI: 10.1016/j.tcs.2012.07.038
arXiv: 1001.5183

Alur R, Cerny P, Weinstein S. 2012. Algorithmic analysis of array-accessing programs. ACM Transactions on Computational Logic (TOCL). 13(3), 27.
LibreCat: https://research-explorer.ista.ac.at/record/2967
DOI: 10.1145/2287718.2287727

Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.
LibreCat: https://research-explorer.ista.ac.at/record/493
DOI: 10.3389/fnins.2012.00055

Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.
LibreCat: https://research-explorer.ista.ac.at/record/495
DOI: 10.4204/EPTCS.96.18

Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.
LibreCat: https://research-explorer.ista.ac.at/record/498
DOI: 10.1111/j.1752-4571.2012.00284.x

Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS, , 6280474.
LibreCat: https://research-explorer.ista.ac.at/record/496
DOI: 10.1109/LICS.2012.65

Boker U, Kupferman O. 2012. Translating to Co-Büchi made tight, unified, and useful. ACM Transactions on Computational Logic (TOCL). 13(4), 29.
LibreCat: https://research-explorer.ista.ac.at/record/494
DOI: 10.1145/2362355.2362357

Sixt MK. 2012. Cell migration: Fibroblasts find a new way to get ahead. Journal of Cell Biology. 197(3), 347–349.
LibreCat: https://research-explorer.ista.ac.at/record/506
DOI: 10.1083/jcb.201204039

Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.
LibreCat: https://research-explorer.ista.ac.at/record/497
DOI: 10.4230/LIPIcs.CSL.2012.167

Chatterjee K, Henzinger MH. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1386–1399.
LibreCat: https://research-explorer.ista.ac.at/record/3165
DOI: 10.1137/1.9781611973099.109
arXiv: 1109.5018

Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280438.
LibreCat: https://research-explorer.ista.ac.at/record/2956
DOI: 10.1109/LICS.2012.30

Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
LibreCat: https://research-explorer.ista.ac.at/record/5377
DOI: 10.15479/AT:IST-2012-0002

Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
LibreCat: https://research-explorer.ista.ac.at/record/5378
DOI: 10.15479/AT:IST-2012-0001

Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280436.
LibreCat: https://research-explorer.ista.ac.at/record/2955
DOI: 10.1109/LICS.2012.28
arXiv: 1107.2141

Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213, 270–285.
LibreCat: https://research-explorer.ista.ac.at/record/3341
DOI: 10.1007/978-3-642-28729-9_18
arXiv: 1107.2009

Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
LibreCat: https://research-explorer.ista.ac.at/record/2957
DOI: 10.1109/LICS.2012.29
arXiv: 1107.2091

Cerny P, Henzinger TA, Radhakrishna A. 2012. Simulation distances. Theoretical Computer Science. 413(1), 21–35.
LibreCat: https://research-explorer.ista.ac.at/record/3249
DOI: 10.1016/j.tcs.2011.08.002

Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, .
LibreCat: https://research-explorer.ista.ac.at/record/3124