Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
4134 Publications
2011 | 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.
View
| Files available
| DOI
2011 | Journal Article | IST-REx-ID: 3315 |
K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” Logical Methods in Computer Science, vol. 7, no. 4. International Federation of Computational Logic, 2011.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3316 |
R. Bloem, K. Chatterjee, K. Greimel, T. A. Henzinger, and B. Jobstmann, “Specification-centered robustness,” in 6th IEEE International Symposium on Industrial and Embedded Systems, Vasteras, Sweden, 2011, pp. 176–185.
View
| DOI
| Download Published Version (ext.)
2011 | 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.
View
| DOI
| Download Submitted Version (ext.)
2011 | 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, USA, 2011, pp. 425–432.
View
2011 | 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, pp. 185–365, 2011.
View
| Files available
| DOI
2011 | Conference Poster | IST-REx-ID: 3322
C. Lampert, Maximum margin multi label structured prediction. Neural Information Processing Systems, 2011.
View
| Files available
2011 | 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 | 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.
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3326 |
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
View
| Files available
| DOI
2011 | 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.
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3329 |
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | 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.
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | 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.
View
| Files available
| DOI
2011 | 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.
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Preprint | IST-REx-ID: 3338 |
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 | Preprint | IST-REx-ID: 3339 |
K. Chatterjee, L. De Alfaro, and R. Pritam, “Magnifying lens abstraction for stochastic games with discounted and long-run average objectives,” arXiv. ArXiv, 2011.
View
| Download Preprint (ext.)
| arXiv