Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.”10.1142/S0129054111008441__IJFCS: International Journal of Foundations of Computer Science, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:10.1142/S0129054111008441.
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:10.2168/LMCS-7(4:8)2011.
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.”10.1145/1963190.1970375__Journal of Experimental Algorithmics, vol. 16, no. 2.2, ACM, 2011, pp. 1–13, doi:10.1145/1963190.1970375.
LibreCat: https://research-explorer.ista.ac.at/record/3965
DOI: 10.1145/1963190.1970375

Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.”10.1007/978-3-642-23175-9_7__Topological Methods in Data Analysis and Visualization II, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:10.1007/978-3-642-23175-9_7.
LibreCat: https://research-explorer.ista.ac.at/record/3271
DOI: 10.1007/978-3-642-23175-9_7

Chen, Chao, and Michael Kerber. Persistent Homology Computation with a Twist. TU Dortmund, 2011, pp. 197–200.
LibreCat: https://research-explorer.ista.ac.at/record/3270

Raveendran, Karthik, et al. Hybrid Smoothed Particle Hydrodynamics. Edited by Stephen Spencer, ACM, 2011, pp. 33–42, doi:10.1145/2019406.2019411.
LibreCat: https://research-explorer.ista.ac.at/record/3298
DOI: 10.1145/2019406.2019411

Wojtan, Chris, et al. Liquid Simulation with Mesh-Based Surface Tracking. 8, ACM, 2011, doi:10.1145/2037636.2037644.
LibreCat: https://research-explorer.ista.ac.at/record/3297
DOI: 10.1145/2037636.2037644

Lohse, Konrad, et al. “A General Method for Calculating Likelihoods under the Coalescent Process.”10.1534/genetics.111.129569__Genetics, vol. 189, no. 3, Genetics Society of America, 2011, pp. 977–87, doi:10.1534/genetics.111.129569.
LibreCat: https://research-explorer.ista.ac.at/record/3290
DOI: 10.1534/genetics.111.129569

Zheng, Ying, et al. “Detailed Reconstruction of 3D Plant Root Shape.”10.1109/ICCV.2011.6126475__Proceedings of the IEEE International Conference on Computer Vision, 6126475, IEEE, 2011, doi:10.1109/ICCV.2011.6126475.
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.”10.1109/ICCV.2011.6126271__Proceedings of the IEEE International Conference on Computer Vision, 6126271, IEEE, 2011, doi:10.1109/ICCV.2011.6126271.
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert et al., Springer.
LibreCat: https://research-explorer.ista.ac.at/record/3311

Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.
LibreCat: https://research-explorer.ista.ac.at/record/3325
DOI: 10.1145/1926385.1926454

Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Wang, Zhikun, et al. Learning Anticipation Policies for Robot Table Tennis. IEEE, 2011, pp. 332–37, doi:10.1109/IROS.2011.6094892.
LibreCat: https://research-explorer.ista.ac.at/record/3337
DOI: 10.1109/IROS.2011.6094892

Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3339
arXiv: 1107.2132

Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.
LibreCat: https://research-explorer.ista.ac.at/record/3342
DOI: 10.1007/978-3-642-22110-1_21
arXiv: 1104.3348

Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.
LibreCat: https://research-explorer.ista.ac.at/record/3347
DOI: 10.1007/978-3-642-21254-3_16
arXiv: 1101.1727

Brázdil, Tomás, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10.
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734