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| Journal Article | IST-REx-ID: 3290 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Lohse, Konrad, Richard Harrison, and Nicholas H Barton. “A General Method for Calculating Likelihoods under the Coalescent Process.” Genetics. Genetics Society of America, 2011. https://doi.org/10.1534/genetics.111.129569.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Poster | IST-REx-ID: 3312 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. Detailed Reconstruction of 3D Plant Root Shape. Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126475.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3313 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” In Proceedings of the IEEE International Conference on Computer Vision. IEEE, 2011. https://doi.org/10.1109/ICCV.2011.6126271.
[Submitted Version]
View
| Files available
| DOI
2011 |In Press| Book Chapter | IST-REx-ID: 3311 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, edited by R van de Weygaert, G Vegter, J Ritzerveld, and V Icke. Springer, n.d.
[Submitted Version]
View
| Files available
2011 |Published| Conference Paper | IST-REx-ID: 3326 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Almagor, Shaull, Udi Boker, and Orna Kupferman. “What’s Decidable about Weighted Automata ,” 6996:482–91. Springer, 2011. https://doi.org/10.1007/978-3-642-24372-1_37.
[Submitted Version]
View
| Files available
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3325
Alur, Rajeev, and Pavol Cerny. “Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs,” 46:599–610. ACM, 2011. 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, Ruzica, and Thomas Wies. “Decision Procedures for Automating Termination Proofs.” edited by Ranjit Jhala and David Schmidt, 6538:371–86. Springer, 2011. 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, Zhikun, Christoph Lampert, Katharina Mülling, Bernhard Schölkopf, and Jan Peters. “Learning Anticipation Policies for Robot Table Tennis,” 332–37. IEEE, 2011. 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, Krishnendu, Luca De Alfaro, and Roy Pritam. “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, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011. 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, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. 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, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.” IEEE, 2011. 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, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/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, 6945:1–1. Springer, 2011. 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, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,” 1318–36. SIAM, 2011. 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, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. 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, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. 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, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/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,” 149–54. ACM, 2011. https://doi.org/10.1145/2038642.2038666.
View
| DOI
2011 |Published| Conference Paper | IST-REx-ID: 3357
Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
View
| DOI