Boker, U., &; Kupferman, O. (2011). Co-Büching them all. In M. Hofmann (Ed.) (Vol. 6604, pp. 184–198). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Saarbrücken, Germany: Springer.https://doi.org/10.1007/978-3-642-19805-2_13 
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 (pp. 332–337). Presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA: IEEE.https://doi.org/10.1109/IROS.2011.6094892 
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. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3339
arXiv: 1107.2132

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 
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 (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 
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. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.10 
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 (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer.https://doi.org/10.1145/1967701.1967734 
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734

Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno &; I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer.https://doi.org/10.1007/978-3-642-24288-5_1 
LibreCat: https://research-explorer.ista.ac.at/record/3344
DOI: 10.1007/978-3-642-24288-5_1

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 
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

Cerny, P., &; Henzinger, T. A. (2011). From boolean to quantitative synthesis (pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM.https://doi.org/10.1145/2038642.2038666 
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

Chatterjee, K., Henzinger, T. A., &; Horn, F. (2011). The complexity of request-response games. In A.-H. Dediu, S. Inenaga, &; C. Martín-Vide (Eds.) (Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_17 
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

Ibáñez, M., Guardia, P., Shavel, A., Cadavid, D., Arbiol, J., Morante, J., &; Cabot, A. (2011). Growth kinetics of asymmetric Bi2 nanocrystals: Size distribution focusing in nanorods. Journal of Physical Chemistry C. American Chemical Society.https://doi.org/10.1021/jp2002904 
LibreCat: https://research-explorer.ista.ac.at/record/336
DOI: 10.1021/jp2002904

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 
LibreCat: https://research-explorer.ista.ac.at/record/3379
DOI: 10.1016/j.ydbio.2011.03.025
PMID: 1463614

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 
LibreCat: https://research-explorer.ista.ac.at/record/3376
DOI: 10.1016/j.molcel.2011.04.016

Logeswaran, S., &; Barton, N. H. (2011). Mapping Mendelian traits in asexual progeny using changes in marker allele frequency. Genetical Research. Cambridge University Press.https://doi.org/10.1017/S0016672311000115 
LibreCat: https://research-explorer.ista.ac.at/record/3380
DOI: 10.1017/S0016672311000115

Edelsbrunner, H., Morozov, D., &; Patel, A. (2011). Quantifying transversality by measuring the robustness of intersections. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-011-9090-8 
LibreCat: https://research-explorer.ista.ac.at/record/3377
DOI: 10.1007/s10208-011-9090-8

Bendich, P., &; Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer.https://doi.org/10.1007/s10208-010-9081-1 
LibreCat: https://research-explorer.ista.ac.at/record/3378
DOI: 10.1007/s10208-010-9081-1