Galkovskyi, Taras, et al. “GiA Roots: Software for the High Throughput Analysis of Plant Root System Architecture.”10.1186/1471-2229-12-116__BMC Plant Biology, vol. 12, 116, BioMed Central, 2012, doi:10.1186/1471-2229-12-116.

Tangermann, Michael, et al. “Review of the BCI Competition IV.”10.3389/fnins.2012.00055__Frontiers in Neuroscience, vol. 6, 55, Frontiers Research Foundation, 2012, doi:10.3389/fnins.2012.00055.

Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”10.4204/EPTCS.96.18__Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:10.4204/EPTCS.96.18.

Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.”10.1111/j.1752-4571.2012.00284.x__Evolutionary Applications, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:10.1111/j.1752-4571.2012.00284.x.

Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.

Boker, Udi, and Orna Kupferman. “Translating to Co-Büchi Made Tight, Unified, and Useful.”10.1145/2362355.2362357__ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4, 29, ACM, 2012, doi:10.1145/2362355.2362357.

Sixt, Michael K. “Cell Migration: Fibroblasts Find a New Way to Get Ahead.”10.1083/jcb.201204039__Journal of Cell Biology, vol. 197, no. 3, Rockefeller University Press, 2012, pp. 347–49, doi:10.1083/jcb.201204039.

Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:10.4230/LIPIcs.CSL.2012.167.

Chatterjee, Krishnendu, and Monika H. Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.”10.1137/1.9781611973099.109__Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–99, doi:10.1137/1.9781611973099.109.

Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”10.1109/LICS.2012.30__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280438, IEEE, 2012, doi:10.1109/LICS.2012.30.

Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012, doi:10.15479/AT:IST-2012-0002.

Chatterjee, Krishnendu, et al. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012, doi:10.15479/AT:IST-2012-0001.

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”10.1109/LICS.2012.28__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280436, IEEE, 2012, doi:10.1109/LICS.2012.28.

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. Vol. 7213, Springer, 2012, pp. 270–85, doi:10.1007/978-3-642-28729-9_18.

Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.”10.1109/LICS.2012.29__Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, 6280437, IEEE, 2012, doi:10.1109/LICS.2012.29.

Cerny, Pavol, et al. “Simulation Distances.”10.1016/j.tcs.2011.08.002__Theoretical Computer Science, vol. 413, no. 1, Elsevier, 2012, pp. 21–35, doi:10.1016/j.tcs.2011.08.002.

Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.

Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.

Porsche, Jana. Actual State of Research Data @ ISTAustria. IST Austria, 2012.

Biswas, Ranita, and Jaya Sil. “An Improved Canny Edge Detection Algorithm Based on Type-2 Fuzzy Sets.”10.1016/j.protcy.2012.05.134__Procedia Technology, vol. 4, Elsevier, 2012, pp. 820–24, doi:10.1016/j.protcy.2012.05.134.