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.




2771 Publications

2011 | Conference Paper | IST-REx-ID: 3302 | OA
Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.
View | Files available
 
2011 | Book Chapter | IST-REx-ID: 3311
Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In Tessellations in the Sciences. Springer, 2011.
View
 
2011 | Conference Poster | IST-REx-ID: 3312 | OA
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.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3313 | OA
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.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3315 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” Logical Methods in Computer Science 7, no. 4 (2011). https://doi.org/10.2168/LMCS-7(4:8)2011.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.” In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011. https://doi.org/10.1109/SIES.2011.5953660.
View | DOI | Download Published Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3318 | OA
Eggermann, Emmanuel, and Peter M Jonas. “How the ‘Slow’ Ca(2+) Buffer Parvalbumin Affects Transmitter Release in Nanodomain Coupling Regimes at GABAergic Synapses.” Nature Neuroscience 15 (2011): 20–22. https://doi.org/10.1038/nn.3002.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3319
Quadrianto, Novi, and Christoph Lampert. “Learning Multi-View Neighborhood Preserving Projections,” 425–32. Omnipress, 2011.
View
 
2011 | Journal Article | IST-REx-ID: 3320 | OA
Nowozin, Sebastian, and Christoph Lampert. “Structured Learning and Prediction in Computer Vision.” Foundations and Trends in Computer Graphics and Vision 6, no. 3–4 (2011): 185–365. https://doi.org/10.1561/0600000033.
View | Files available | DOI
 
2011 | Conference Poster | IST-REx-ID: 3322
Lampert, Christoph. Maximum Margin Multi Label Structured Prediction. NIPS: Neural Information Processing Systems. Neural Information Processing Systems, 2011.
View | Files available
 
2011 | Conference Paper | IST-REx-ID: 3323
Wies, Thomas, Marco Muñiz, and Viktor Kuncak. “An Efficient Decision Procedure for Imperative Tree Data Structures,” 6803:476–91. Springer, 2011. https://doi.org/10.1007/978-3-642-22438-6_36.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3324 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
2011 | 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 | Conference Paper | IST-REx-ID: 3326 | OA
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.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3328 | OA
Berberich, Eric, Michael Hemmer, and Michael Kerber. “A Generic Algebraic Kernel for Non Linear Geometric Applications,” 179–86. ACM, 2011. https://doi.org/10.1145/1998196.1998224.
View | DOI | Download Published Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3329 | OA
Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Deconstructing Approximate Offsets.” In Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, 187–96. ACM, 2011. https://doi.org/10.1145/1998196.1998225.
View | Files available | DOI | Download Preprint (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3330 | OA
Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920 .
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3332 | OA
Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics 27, no. 3 (2011): 419–30. https://doi.org/10.1007/s00373-011-1020-7.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, János Pach, and Günter Ziegler. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry 45, no. 1 (2011): 1–2. https://doi.org/10.1007/s00454-010-9313-9.
View | DOI
 
2011 | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert, Rien, Gert Vegter, Herbert Edelsbrunner, Bernard Jones, Pratyush Pranav, Changbom Park, Wojciech Hellwing, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” In Transactions on Computational Science XIV, edited by Marina Gavrilova, Kenneth Tan, and Mir Mostafavi, 6970:60–101. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer, 2011. https://doi.org/10.1007/978-3-642-25249-5_3.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3336
Chen, Chao, Daniel Freedman, and Christoph Lampert. “Enforcing Topological Constraints in Random Field Image Segmentation.” In CVPR: Computer Vision and Pattern Recognition, 2089–96. IEEE, 2011. https://doi.org/10.1109/CVPR.2011.5995503.
View | Files available | DOI
 
2011 | 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 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
View | Files available | Download Preprint (ext.) | arXiv
 
2011 | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.
View | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, Krishnendu, Monika 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.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, Krishnendu, and Monika 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.
View | DOI | Download Submitted Version (ext.)
 
2011 | 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 | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3346 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3348 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
View | DOI | Download Submitted Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3352
Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.” Communications of the ACM 54, no. 10 (2011): 72–82. https://doi.org/10.1145/2001269.2001289.
View | DOI
 
2011 | Journal Article | IST-REx-ID: 3353 | OA
Tripakis, Stavros, Ben Lickly, Thomas A Henzinger, and Edward Lee. “A Theory of Synchronous Relational Interfaces.” ACM Transactions on Programming Languages and Systems (TOPLAS) 33, no. 4 (2011). https://doi.org/10.1145/1985342.1985345.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.” ACM Transactions on Computational Logic (TOCL) 12, no. 4 (2011). https://doi.org/10.1145/1970398.1970404.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3355 | OA
Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.33.
View | Files available | DOI
 
2011 | 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
 
2011 | Conference Paper | IST-REx-ID: 3358 | OA
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.
View | DOI | Download Published Version (ext.)
 
2011 | 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 | Conference Paper | IST-REx-ID: 3360 | OA
Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,” 12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361 | OA
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.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3362 | OA
Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.
View | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3364 | OA
Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical Computer Science 412, no. 21 (2011): 2128–41. https://doi.org/10.1016/j.tcs.2010.10.022.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,” 6605:267–71. Springer, 2011. https://doi.org/10.1007/978-3-642-19835-9_24.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_20 .
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3367
Chen, Chao, and Michael Kerber. “An Output Sensitive Algorithm for Persistent Homology,” 207–16. ACM, 2011. https://doi.org/10.1145/1998196.1998228.
View | Files available | DOI
 

Search

Filter Publications