Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
5270 Publications
2011 |Published| Conference Paper | IST-REx-ID: 3325
Alur, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3324 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3337
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
View
| DOI
2011 |Published| Preprint | IST-REx-ID: 3339 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3342 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3347 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3346 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, 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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3348 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3344
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
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3343 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3360 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3361 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3358 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3359
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
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3357
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
View
| DOI
2011 |Published| Journal Article | IST-REx-ID: 3379 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| PubMed | Europe PMC
2011 |Published| Journal Article | IST-REx-ID: 3376 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3380 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3378
Bendich, P., & Harer, J. (2011). Persistent intersection homology. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-010-9081-1
View
| DOI