K. Chatterjee, L. De Alfaro, and R. Pritam, “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

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

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

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

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

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

K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101

U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82

P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
LibreCat: https://research-explorer.ista.ac.at/record/3361
DOI: 10.1109/CSF.2011.21

T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011, pp. 329–342.
LibreCat: https://research-explorer.ista.ac.at/record/3358
DOI: 10.1145/1966445.1966476

P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.
LibreCat: https://research-explorer.ista.ac.at/record/3359
DOI: 10.1145/2038642.2038666

K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
LibreCat: https://research-explorer.ista.ac.at/record/3357
DOI: 10.1007/978-3-642-21254-3_17

R. Row, J.-L. Maître, B. Martin, P. Stockinger, C.-P. J. Heisenberg, and D. Kimelman, “Completion of the epithelial to mesenchymal transition in zebrafish mesoderm requires Spadetail,” Developmental Biology, vol. 354, no. 1. Elsevier, pp. 102–110, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3379
DOI: 10.1016/j.ydbio.2011.03.025
PMID: 1463614

M. T. Bollenbach and R. Kishony, “Resolution of gene regulatory conflicts caused by combinations of antibiotics,” Molecular Cell, vol. 42, no. 4. Cell Press, pp. 413–425, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3376
DOI: 10.1016/j.molcel.2011.04.016

S. Logeswaran and N. H. Barton, “Mapping Mendelian traits in asexual progeny using changes in marker allele frequency,” Genetical Research, vol. 93, no. 3. Cambridge University Press, pp. 221–232, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3380
DOI: 10.1017/S0016672311000115

H. Edelsbrunner, D. Morozov, and A. Patel, “Quantifying transversality by measuring the robustness of intersections,” Foundations of Computational Mathematics, vol. 11, no. 3. Springer, pp. 345–361, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3377
DOI: 10.1007/s10208-011-9090-8

P. Bendich and J. Harer, “Persistent intersection homology,” Foundations of Computational Mathematics, vol. 11, no. 3. Springer, pp. 305–336, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3378
DOI: 10.1007/s10208-010-9081-1

L. V. Ugelvig, P. Nielsen, J. Boomsma, and D. Nash, “Reconstructing eight decades of genetic variation in an isolated Danish population of the large blue butterfly Maculinea arion,” BMC Evolutionary Biology, vol. 11, no. 201. BioMed Central, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3388
DOI: 10.1186/1471-2148-11-201

G. Tkadik et al., “Natural images from the birthplace of the human eye,” PLoS One, vol. 6, no. 6. Public Library of Science, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3384
DOI: 10.1371/journal.pone.0020409

A. Kupczok, “Split based computation of majority rule supertrees,” BMC Evolutionary Biology, vol. 11, no. 205. BioMed Central, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/3387
DOI: 10.1186/1471-2148-11-205