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, 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.
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, 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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3337
Wang, Zhikun, et al. Learning Anticipation Policies for Robot Table Tennis. IEEE, 2011, pp. 332–37, doi: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, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.
[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, 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.
[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, Krishnendu, and Nathanaël Fijalkow. Finitary Languages. Vol. 6638, Springer, 2011, pp. 216–26, doi: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, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi: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, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. Graph Games with Reachability Objectives. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi: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, Krishnendu, and Monika H. Henzinger. Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM, 2011, pp. 1318–36, doi: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, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata. Vol. 12, Springer, 2011, pp. 82–96, doi: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, Pavol, et al. The Complexity of Quantitative Information Flow Problems. IEEE, 2011, pp. 205–17, doi: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, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement. ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3359
Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis. ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games. Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi: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, Richard, et al. “Completion of the Epithelial to Mesenchymal Transition in Zebrafish Mesoderm Requires Spadetail.” Developmental Biology, vol. 354, no. 1, Elsevier, 2011, pp. 102–10, doi: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, Mark Tobias, and Roy Kishony. “Resolution of Gene Regulatory Conflicts Caused by Combinations of Antibiotics.” Molecular Cell, vol. 42, no. 4, Cell Press, 2011, pp. 413–25, doi: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, Sayanthan, and Nicholas H. Barton. “Mapping Mendelian Traits in Asexual Progeny Using Changes in Marker Allele Frequency.” Genetical Research, vol. 93, no. 3, Cambridge University Press, 2011, pp. 221–32, doi: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, Herbert, et al. “Quantifying Transversality by Measuring the Robustness of Intersections.” Foundations of Computational Mathematics, vol. 11, no. 3, Springer, 2011, pp. 345–61, doi:10.1007/s10208-011-9090-8.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Journal Article | IST-REx-ID: 3378
Bendich, Paul, and John Harer. “Persistent Intersection Homology.” Foundations of Computational Mathematics, vol. 11, no. 3, Springer, 2011, pp. 305–36, doi:10.1007/s10208-010-9081-1.
View
| DOI