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.

Co-Büching them all
U. Boker, O. Kupferman, in:, M. Hofmann (Ed.), Springer, 2011, pp. 184–198.

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.

Two views on multiple mean payoff objectives in Markov Decision Processes
T. Brázdil, V. Broeek, K. Chatterjee, V. Forejt, A. Kudera, in:, IEEE, 2011.

Synthesis of memory efficient real time controllers for safety objectives
K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.

Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.

Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.

Determinizing discounted-sum automata
U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.

The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.

Scheduling large jobs by abstraction refinement
T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.

From boolean to quantitative synthesis
P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.

The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.