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

Raveendran, K., Wojtan, C., &; Turk, G. (2011). Hybrid smoothed particle hydrodynamics. In S. Spencer (Ed.) (pp. 33–42). Presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada: ACM.https://doi.org/10.1145/2019406.2019411 

Wojtan, C., Müller Fischer, M., &; Brochu, T. (2011). Liquid simulation with mesh-based surface tracking. Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada: ACM.https://doi.org/10.1145/2037636.2037644 

Lohse, K., Harrison, R., &; Barton, N. H. (2011). A general method for calculating likelihoods under the coalescent process. Genetics. Genetics Society of America.https://doi.org/10.1534/genetics.111.129569 

Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., &; Benfey, P. (2011). Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126475 

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

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

Almagor, S., Boker, U., &; Kupferman, O. (2011). What’s decidable about weighted automatahttps://doi.org/10.1007/978-3-642-24372-1_37__(Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer.https://doi.org/10.1007/978-3-642-24372-1_37 

Piskac, R., &; Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala &; D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer.https://doi.org/10.1007/978-3-642-18275-4_26 

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

Chatterjee, K., Henzinger, M. H., Joglekar, M., &; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer.https://doi.org/10.1007/978-3-642-22110-1_21 

Chatterjee, K., &; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_16 

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.10 

Chatterjee, K., &; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer.https://doi.org/10.1145/1967701.1967734 

Chatterjee, K., &; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM.https://doi.org/10.1137/1.9781611973082.101 

Boker, U., &; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer.https://doi.org/10.4230/LIPIcs.CSL.2011.82 

Cerny, P., Chatterjee, K., &; Henzinger, T. A. (2011). The complexity of quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France: IEEE.https://doi.org/10.1109/CSF.2011.21 

Henzinger, T. A., Singh, V., Wies, T., &; Zufferey, D. (2011). Scheduling large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys, Salzburg, Austria: ACM.https://doi.org/10.1145/1966445.1966476 

Row, R., Maître, J.-L., Martin, B., Stockinger, P., Heisenberg, C.-P. J., &; Kimelman, D. (2011). Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail. Developmental Biology. Elsevier.https://doi.org/10.1016/j.ydbio.2011.03.025 

Bollenbach, M. T., &; Kishony, R. (2011). Resolution of gene regulatory conflicts caused by combinations of antibiotics. Molecular Cell. Cell Press.https://doi.org/10.1016/j.molcel.2011.04.016