A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012, vol. 96, pp. 238–246.

M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” Evolutionary Applications, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012.

A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.

U. Boker and O. Kupferman, “Translating to Co-Büchi made tight, unified, and useful,” ACM Transactions on Computational Logic (TOCL), vol. 13, no. 4. ACM, 2012.

M. K. Sixt, “Cell migration: Fibroblasts find a new way to get ahead,” Journal of Cell Biology, vol. 197, no. 3. Rockefeller University Press, pp. 347–349, 2012.

K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.

K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.

K. Chatterjee and Y. Velner, “Mean payoff pushdown games,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.

K. Chatterjee and Y. Velner, Mean-payoff pushdown games. IST Austria, 2012.

K. Chatterjee, S. Chaubal, and P. Kamath, Faster algorithms for alternating refinement relations. IST Austria, 2012.

K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia, 2012.

K. Chatterjee, “Robustness of structurally equivalent concurrent parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Tallinn, Estonia, 2012, vol. 7213, pp. 270–285.

K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.

P. Cerny, T. A. Henzinger, and A. Radhakrishna, “Simulation distances,” Theoretical Computer Science, vol. 413, no. 1. Elsevier, pp. 21–35, 2012.

F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.

F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.

J. Porsche, Actual state of research data @ ISTAustria. IST Austria, 2012.

M. Konrad et al., “Social transfer of pathogenic fungus promotes active immunisation in ant colonies,” PLoS Biology, vol. 10, no. 4. Public Library of Science, 2012.

M. Konrad et al., “Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies.” Dryad, 2012.

S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates.” Dryad, 2012.

S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.” Dryad, 2012.

K. Lohse, N. H. Barton, G. Melika, and G. Stone, “A likelihood based comparison of population histories in a parasitoid guild,” Molecular Ecology, vol. 21, no. 18. Wiley-Blackwell, pp. 4605–4617, 2012.

K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.

A. Bouajjani, C. Dragoi, C. Enea, and M. Sighireanu, “Accurate invariant checking for programs manipulating lists and arrays with infinite data,” in Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 167–182.

K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.

S. Grebenshchikov, A. Gupta, N. P. Lopes, C. Popeea, and A. Rybalchenko, “HSF(C): A software verifier based on Horn clauses,” in Tools and Algorithms for the Construction and Analysis of Systems, Tallinn, Estonia, 2012, vol. 7214, pp. 549–551.

A. Gupta, “Improved Single Pass Algorithms for Resolution Proof Reduction,” in Automated Technology for Verification and Analysis, vol. 7561, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 107–121.

D. Zufferey, T. Wies, and T. A. Henzinger, “Ideal abstractions for well structured transition systems,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Philadelphia, PA, USA, 2012, vol. 7148, pp. 445–460.

L. Diaz Jr et al., “The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers,” Nature, vol. 486, no. 7404. Nature Publishing Group, pp. 537–540, 2012.

K. Chatterjee, J. Reiter, and M. Nowak, “Evolutionary dynamics of biological auctions,” Theoretical Population Biology, vol. 81, no. 1. Academic Press, pp. 69–80, 2012.

S. Kim, J. Guzmán, H. Hu, and P. M. Jonas, “Active dendrites support efficient initiation of dendritic spikes in hippocampal C pyramidal neurons,” Nature Neuroscience, vol. 15, no. 4. Nature Publishing Group, pp. 600–606, 2012.

S. Kim, “Active properties of hippocampal C pyramidal neuron dendrites,” Institute of Science and Technology Austria, 2012.

V. Barone and C.-P. J. Heisenberg, “Cell adhesion in embryo morphogenesis,” Current Opinion in Cell Biology, vol. 24, no. 1. Elsevier, pp. 148–153, 2012.

C. A. Ibarra et al., “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” Science, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.

F. Pausinger, “Elementary solutions of the Bernstein problem on two intervals,” Journal of Mathematical Physics, Analysis, Geometry, vol. 8, no. 1. B. Verkin Institute for Low Temperature Physics and Engineering, pp. 63–78, 2012.

J. Yu, C. Wojtan, G. Turk, and C. Yap, “Explicit mesh surfaces for particle based fluids,” in Computer Graphics Forum, Cagliari, Sardinia, Italy, 2012, vol. 31, no. 2, pp. 815–824.

P. Danowski, “Die Zeit des Abwartens ist vorbei!,” BuB - Forum Bibliothek und Information, vol. 64, no. 4. Fachzeitschrift des BIB – Berufsverband Information Bibliothek, p. 284, 2012.

P. Danowski, “Zwischen Technologie und Information,” Büchereiperspektiven, vol. 2012, no. 1. Büchereiverband Österreichs, p. 11, 2012.

O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012.

H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” Russian Mathematical Surveys, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.

N. Quadrianto, C. Lampert, and C. Chen, “The most persistent soft-clique in a set of sampled graphs,” in Proceedings of the 29th International Conference on Machine Learning, Edinburgh, United Kingdom, 2012, pp. 211–218.

F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” Journal de Theorie des Nombres des Bordeaux, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.

H. Edelsbrunner et al., “Fractal and computational geometry for generalizing cartographic objects,” Modeling and Analysis of Information Systems, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.

A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.

A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in NIPS Proceedings, Granada, Spain, 2011, vol. 24, pp. 1827–1835.

Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” Computer Graphics Forum, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.

C. Chen and D. Freedman, “Hardness results for homology localization,” Discrete &; Computational Geometry, vol. 45, no. 3. Springer, pp. 425–448, 2011.

M. Smutny, S. Wu, G. Gomez, S. Mangold, A. Yap, and N. Hamilton, “Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens,” PLoS One, vol. 6, no. 7. Public Library of Science, 2011.

V. Ruprecht, M. Axmann, S. Wieser, and G. Schuetz, “What can we learn from single molecule trajectories?,” Current Protein &; Peptide Science, vol. 12, no. 8. Bentham Science Publishers, pp. 714–724, 2011.

T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.

T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.

T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3.

R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.

E. Eggermann and P. M. Jonas, “How the ‘slow’ Ca(2+) buffer parvalbumin affects transmitter release in nanodomain coupling regimes at GABAergic synapses,” Nature Neuroscience, vol. 15. Nature Publishing Group, pp. 20–22, 2011.

R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.

E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.

M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.

M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.

E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.

H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete &; Computational Geometry, vol. 45, no. 1. Springer, pp. 1–2, 2011.

S. Tripakis, B. Lickly, T. A. Henzinger, and E. Lee, “A theory of synchronous relational interfaces,” ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 33, no. 4. ACM, 2011.

R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.

K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.

K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.

K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.

J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.

J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi, “Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen, Germany, 2011, vol. 6901, pp. 404–418.

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.

C. Chen and M. Kerber, “An output sensitive algorithm for persistent homology,” presented at the SoCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 207–216.

K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.

P. Abbot et al., “Inclusive fitness theory and eusociality,” Nature, vol. 471, no. 7339. Nature Publishing Group, pp. –, 2011.

M. K. Sixt and C. Parent, “Cells on the move in Philadelphia,” Molecular Biology and Evolution, vol. 22, no. 6. Oxford University Press, p. 724, 2011.

G. Tkadik and A. Walczak, “Information transmission in genetic regulatory networks a review,” Journal of Physics: Condensed Matter, vol. 23, no. 15. IOP Publishing Ltd., 2011.

G. Krens, S. Möllmert, and C.-P. J. Heisenberg, “Enveloping cell layer differentiation at the surface of zebrafish germ layer tissue explants,” PNAS, vol. 108, no. 3. National Academy of Sciences, pp. –, 2011.

A. Kupczok, “Consequences of different null models on the tree shape bias of supertree methods,” Systematic Biology, vol. 60, no. 2. Oxford University Press, pp. 218–225, 2011.

A. Pernia-Andrade and P. M. Jonas, “The multiple faces of RIM,” Neuron, vol. 69, no. 2. Elsevier, pp. 185–187, 2011.

P. Stockinger, C.-P. J. Heisenberg, and J.-L. Maître, “Defective neuroepithelial cell cohesion affects tangential branchiomotor neuron migration in the zebrafish neural tube,” Development, vol. 138, no. 21. Company of Biologists, pp. 4673–4683, 2011.

J. Polechova and N. H. Barton, “Genetic drift widens the expected cline but narrows the expected cline width,” Genetics, vol. 189, no. 1. Genetics Society of America, pp. 227–235, 2011.

N. H. Barton and A. Etheridge, “The relation between reproductive value and genetic contribution,” Genetics, vol. 188, no. 4. Genetics Society of America, pp. 953–973, 2011.

H. de Vladar and N. H. Barton, “The contribution of statistical physics to evolutionary biology,” Trends in Ecology and Evolution, vol. 26, no. 8. Cell Press, pp. 424–432, 2011.

J.-L. Maître and C.-P. J. Heisenberg, “The role of adhesion energy in controlling cell-cell contacts,” Current Opinion in Cell Biology, vol. 23, no. 5. Elsevier, pp. 508–514, 2011.

H. L. Janovjak, G. Sandoz, and E. Isacoff, “Modern ionotropic glutamate receptor with a K+ selectivity signature sequence,” Nature Communications, vol. 2, no. 232. Nature Publishing Group, pp. 1–6, 2011.

N. Plachta, M. T. Bollenbach, S. Pease, S. Fraser, and P. Pantazis, “Oct4 kinetics predict cell lineage patterning in the early mammalian embryo,” Nature Cell Biology, vol. 13, no. 2. Nature Publishing Group, pp. 117–123, 2011.

M. K. Sixt and T. Lämmermann, “In vitro analysis of chemotactic leukocyte migration in 3D environments,” Cell Migration, vol. 769. Springer, pp. 149–165, 2011.

F. Palero, G. Guerao, P. Clark, and P. Abello, “Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description,” Journal of the Marine Biological Association of the United Kingdom, vol. 91, no. 2. Cambridge University Press, pp. 485–492, 2011.

B. T. Fasy, “The difference in length of curves in R^n,” Acta Sci. Math. (Szeged), vol. 77, no. 1–2. Szegedi Tudományegyetem, pp. 359–367, 2011.

H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal distortion in R^n,” in Rainbow of Computer Science, vol. 6570, C. Calude, G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.

T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.

K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.

B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching the Gauss sphere,” Journal of Experimental Algorithmics, vol. 16, no. 2.2. ACM, pp. 1–13, 2011.

H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in Topological Methods in Data Analysis and Visualization II, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.

C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.

K. Raveendran, C. Wojtan, and G. Turk, “Hybrid smoothed particle hydrodynamics,” presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada, 2011, pp. 33–42.

C. Wojtan, M. Müller Fischer, and T. Brochu, “Liquid simulation with mesh-based surface tracking,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada, 2011.

K. Lohse, R. Harrison, and N. H. Barton, “A general method for calculating likelihoods under the coalescent process,” Genetics, vol. 189, no. 3. Genetics Society of America, pp. 977–987, 2011.

Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.

C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.

H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.

S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.