Faust S, Pietrzak KZ, Venturi D. Tamper proof circuits How to trade leakage for tamper resilience. In: Vol 6755. Springer; 2011:391-402. doi:10.1007/978-3-642-22006-7_33

Jain A, Pietrzak KZ. Parallel repetition for leakage resilience amplification revisited. In: Vol 6597. Springer; 2011:58-69. doi:10.1007/978-3-642-19571-6_5

Prentice J, Homann J, Simmons K, Tkadik G, Balasubramanian V, Nelson P. Fast, scalable, Bayesian spike identification for multi-electrode arrays. PLoS One. 2011;6(7). doi:10.1371/journal.pone.0019884

Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. Topological Methods in Data Analysis and Visualization II. Springer; 2011:91-106. doi:10.1007/978-3-642-23175-9_7

Vila R, Pierce N, Nash D, Ugelvig LV. A phylogenetic revision of the Glaucopsyche section (Lepidoptera: Lycaenidae), with special focus on the Phengaris-Maculinea clade. Molecular Phylogenetics and Evolution. 2011;61(1):237-243. doi:10.1016/j.ympev.2011.05.016

Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund; 2011:197-200.

Raveendran K, Wojtan C, Turk G. Hybrid smoothed particle hydrodynamics. In: Spencer S, ed. ACM; 2011:33-42. doi:10.1145/2019406.2019411

Wojtan C, Müller Fischer M, Brochu T. Liquid simulation with mesh-based surface tracking. In: ACM; 2011. doi:10.1145/2037636.2037644

Lohse K, Harrison R, Barton NH. A general method for calculating likelihoods under the coalescent process. Genetics. 2011;189(3):977-987. doi:10.1534/genetics.111.129569

Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. Detailed Reconstruction of 3D Plant Root Shape. IEEE; 2011. doi:10.1109/ICCV.2011.6126475

Chen C, Edelsbrunner H. Diffusion runs low on persistence fast. In: Proceedings of the IEEE International Conference on Computer Vision. IEEE; 2011. doi:10.1109/ICCV.2011.6126271

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

Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37

Alur R, Cerny P. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454

Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi:10.1007/978-3-642-18275-4_26

Boker U, Kupferman O. Co-Büching them all. In: Hofmann M, ed. Vol 6604. Springer; 2011:184-198. doi:10.1007/978-3-642-19805-2_13

Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. Learning anticipation policies for robot table tennis. In: IEEE; 2011:332-337. doi:10.1109/IROS.2011.6094892

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

Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:10.1007/978-3-642-22110-1_21

Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16