The difference in length of curves in R^n
B.T. Fasy, Acta Sci. Math. (Szeged) 77 (2011) 359–367.

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

Formalisms for specifying Markovian population models
T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.

Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).

Computing elevation maxima by searching the Gauss sphere
B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics 16 (2011) 1–13.

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

Persistent homology computation with a twist
C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200.

Hybrid smoothed particle hydrodynamics
K. Raveendran, C. Wojtan, G. Turk, in:, S. Spencer (Ed.), ACM, 2011, pp. 33–42.

Liquid simulation with mesh-based surface tracking
C. Wojtan, M. Müller Fischer, T. Brochu, in:, ACM, 2011.

A general method for calculating likelihoods under the coalescent process
K. Lohse, R. Harrison, N.H. Barton, Genetics 189 (2011) 977–987.

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

Diffusion runs low on persistence fast
C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011.

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

What’s decidable about weighted automata 
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.

Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.

Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.

Learning anticipation policies for robot table tennis
Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, J. Peters, in:, IEEE, 2011, pp. 332–337.

Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).

Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.

Finitary languages
K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.