Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Raveendran K, Wojtan C, Turk G. 2011. Hybrid smoothed particle hydrodynamics. SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 33–42.
LibreCat: https://research-explorer.ista.ac.at/record/3298
DOI: 10.1145/2019406.2019411

Wojtan C, Müller Fischer M, Brochu T. 2011. Liquid simulation with mesh-based surface tracking. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 8.
LibreCat: https://research-explorer.ista.ac.at/record/3297
DOI: 10.1145/2037636.2037644

Lohse K, Harrison R, Barton NH. 2011. A general method for calculating likelihoods under the coalescent process. Genetics. 189(3), 977–987.
LibreCat: https://research-explorer.ista.ac.at/record/3290
DOI: 10.1534/genetics.111.129569

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

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

Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .
LibreCat: https://research-explorer.ista.ac.at/record/3311

Almagor S, Boker U, Kupferman O. 2011. What’s decidable about weighted automata . ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6996, 482–491.
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

Alur R, Cerny P. 2011. Streaming transducers for algorithmic verification of single pass list processing programs. POPL: Principles of Programming Languages vol. 46, 599–610.
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

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

Boker U, Kupferman O. 2011. Co-Büching them all. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 6604, 184–198.
LibreCat: https://research-explorer.ista.ac.at/record/3327
DOI: 10.1007/978-3-642-19805-2_13

Wang Z, Lampert C, Mülling K, Schölkopf B, Peters J. 2011. Learning anticipation policies for robot table tennis. IROS: RSJ International Conference on Intelligent Robots and Systems, 332–337.
LibreCat: https://research-explorer.ista.ac.at/record/3337
DOI: 10.1109/IROS.2011.6094892

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

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

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

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

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

Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945, 1–1.
LibreCat: https://research-explorer.ista.ac.at/record/3344
DOI: 10.1007/978-3-642-24288-5_1

Chatterjee K, Henzinger MH. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101

Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL: Computer Science Logic, LIPIcs, vol. 12, 82–96.
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82