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.
LibreCat: https://research-explorer.ista.ac.at/record/3405
DOI: 10.1038/ncomms1231

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.
LibreCat: https://research-explorer.ista.ac.at/record/3505
DOI: 10.1007/978-1-61779-207-6_11

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.
LibreCat: https://research-explorer.ista.ac.at/record/3784
DOI: 10.1017/S0025315410000287

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.
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

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.
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

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.
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

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.
LibreCat: https://research-explorer.ista.ac.at/record/3298
DOI: 10.1145/2019406.2019411

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.
LibreCat: https://research-explorer.ista.ac.at/record/3297
DOI: 10.1145/2037636.2037644

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.
LibreCat: https://research-explorer.ista.ac.at/record/3290
DOI: 10.1534/genetics.111.129569

Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

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.
LibreCat: https://research-explorer.ista.ac.at/record/3311

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.
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3339
arXiv: 1107.2132

K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
LibreCat: https://research-explorer.ista.ac.at/record/3342
DOI: 10.1007/978-3-642-22110-1_21
arXiv: 1104.3348

K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
LibreCat: https://research-explorer.ista.ac.at/record/3347
DOI: 10.1007/978-3-642-21254-3_16
arXiv: 1101.1727

T. Brázdil, V. Broeek, K. Chatterjee, V. Forejt, and A. Kudera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734

K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101