Raveendran, Karthik, Chris Wojtan, and Greg Turk. “Hybrid Smoothed Particle Hydrodynamics.”https://doi.org/10.1145/2019406.2019411__edited by Stephen Spencer, 33–42. ACM, 2011.https://doi.org/10.1145/2019406.2019411 .

Wojtan, Chris, Matthias Müller Fischer, and Tyson Brochu. “Liquid Simulation with Mesh-Based Surface Tracking.”https://doi.org/10.1145/2037636.2037644__ACM, 2011.https://doi.org/10.1145/2037636.2037644 .

Lohse, Konrad, Richard Harrison, and Nicholas H Barton. “A General Method for Calculating Likelihoods under the Coalescent Process.”https://doi.org/10.1534/genetics.111.129569__Genetics. Genetics Society of America, 2011.https://doi.org/10.1534/genetics.111.129569 .

Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011.https://doi.org/10.1109/ICCV.2011.6126475 .

Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.”https://doi.org/10.1109/ICCV.2011.6126271__In Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011.https://doi.org/10.1109/ICCV.2011.6126271 .

Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert, G Vegter, J Ritzerveld, and V Icke. Springer, n.d.

Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,”https://doi.org/10.1007/978-3-642-24372-1_37__6996:482–91. Springer, 2011.https://doi.org/10.1007/978-3-642-24372-1_37 .

Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,”https://doi.org/10.1145/1926385.1926454__46:599–610. ACM, 2011.https://doi.org/10.1145/1926385.1926454 .

Piskac, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.”https://doi.org/10.1007/978-3-642-18275-4_26__edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011.https://doi.org/10.1007/978-3-642-18275-4_26 .

Wang, Zhikun, Christoph Lampert, Katharina Mülling, Bernhard Schölkopf, and Jan Peters. “Learning Anticipation Policies for Robot Table Tennis,”https://doi.org/10.1109/IROS.2011.6094892__332–37. IEEE, 2011.https://doi.org/10.1109/IROS.2011.6094892 .

Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.

Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1007/978-3-642-22110-1_21__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_21 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,”https://doi.org/10.1007/978-3-642-21254-3_16__6638:216–26. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_16 .

Brázdil, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2011.10__IEEE, 2011.https://doi.org/10.1109/LICS.2011.10 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,”https://doi.org/10.1145/1967701.1967734__221–30. Springer, 2011.https://doi.org/10.1145/1967701.1967734 .

Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.”https://doi.org/10.1007/978-3-642-24288-5_1__edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011.https://doi.org/10.1007/978-3-642-24288-5_1 .

Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,”https://doi.org/10.1137/1.9781611973082.101__1318–36. SIAM, 2011.https://doi.org/10.1137/1.9781611973082.101 .

Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”https://doi.org/10.4230/LIPIcs.CSL.2011.82__12:82–96. Springer, 2011.https://doi.org/10.4230/LIPIcs.CSL.2011.82 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,”https://doi.org/10.1145/1966445.1966476__329–42. ACM, 2011.https://doi.org/10.1145/1966445.1966476 .