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.
5368 Publications
2011 | Published | Journal Article | IST-REx-ID: 3318 | 
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. Nature Publishing Group, 2011. https://doi.org/10.1038/nn.3002.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3319
Quadrianto, Novi, and Christoph Lampert. “Learning Multi-View Neighborhood Preserving Projections,” 425–32. ML Research Press, 2011.
View
2011 | Published | Journal Article | IST-REx-ID: 3320 |
Nowozin, Sebastian, and Christoph Lampert. “Structured Learning and Prediction in Computer Vision.” Foundations and Trends in Computer Graphics and Vision. Now Publishers, 2011. https://doi.org/10.1561/0600000033.
[Published Version]
View
| Files available
| DOI
2011 | Published | Conference Poster | IST-REx-ID: 3322
Lampert, Christoph. Maximum Margin Multi Label Structured Prediction. NIPS: Neural Information Processing Systems. Neural Information Processing Systems Foundation, 2011.
View
| Files available
2011 | Published | 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 | Published | Conference Paper | IST-REx-ID: 3324 |
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: 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: 3326 |
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: 3328 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3329 |
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.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3330 |
Kerber, Michael, and Michael Sagraloff. “Root Refinement for Real Polynomials,” 209–16. Springer, 2011. https://doi.org/10.1145/1993886.1993920.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3332 |
Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics. Springer, 2011. https://doi.org/10.1007/s00373-011-1020-7.
[Submitted Version]
View
| Files available
| DOI
2011 | Published | 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. Springer, 2011. https://doi.org/10.1007/s00454-010-9313-9.
View
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3335 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | 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 | 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: 3338 |
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 | Published | Preprint | IST-REx-ID: 3339 |
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 |
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: 3343 |
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.)