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.
5794 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3301 | 
T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.
[Submitted Version]
View
| Files available
2011 | Published | Conference Paper | IST-REx-ID: 3302 |
T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.
[Submitted Version]
View
| Files available
2011 | In Press | Book Chapter | IST-REx-ID: 3311 |
H. Edelsbrunner, “Alpha shapes - a survey,” in Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.
[Submitted Version]
View
| Files available
2011 | Published | Conference Poster | IST-REx-ID: 3312 |
Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, Detailed reconstruction of 3D plant root shape. IEEE, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3313 |
C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in Proceedings of the IEEE International Conference on Computer Vision, Barcelona, Spain, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Journal Article | IST-REx-ID: 3318 |
E. Eggermann and P. M. Jonas, “How the ‘slow’ Ca(2+) buffer parvalbumin affects transmitter release in nanodomain coupling regimes at GABAergic synapses,” Nature Neuroscience, vol. 15. Nature Publishing Group, pp. 20–22, 2011.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3319
N. Quadrianto and C. Lampert, “Learning multi-view neighborhood preserving projections,” presented at the ICML: International Conference on Machine Learning, Bellevue, United States, 2011, pp. 425–432.
View
2011 | Published | Journal Article | IST-REx-ID: 3320 |
S. Nowozin and C. Lampert, “Structured learning and prediction in computer vision,” Foundations and Trends in Computer Graphics and Vision, vol. 6, no. 3–4. Now Publishers, pp. 185–365, 2011.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3323
T. Wies, M. Muñiz, and V. Kuncak, “An efficient decision procedure for imperative tree data structures,” presented at the CADE 23: Automated Deduction , Wrocław, Poland, 2011, vol. 6803, pp. 476–491.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3324 |
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3328 |
E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3330 |
M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3332 |
M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3335 |
R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3336
C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, United States, 2011, pp. 2089–2096.
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3343 |
K. Chatterjee and M. 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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3355 |
R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen, Germany, 2011, pp. 255–264.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3358 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)