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.




5242 Publications

2011 | Published | Conference Poster | IST-REx-ID: 3322
Maximum margin multi label structured prediction
C. Lampert, Maximum Margin Multi Label Structured Prediction, Neural Information Processing Systems Foundation, 2011.
View | Files available
 
2011 | Published | Conference Paper | IST-REx-ID: 3323
An efficient decision procedure for imperative tree data structures
T. Wies, M. Muñiz, V. Kuncak, in:, Springer, 2011, pp. 476–491.
View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3324 | OA
Decision procedures for automating termination proofs
R. Piskac, T. Wies, in:, R. Jhala, D. Schmidt (Eds.), Springer, 2011, pp. 371–386.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3325
Streaming transducers for algorithmic verification of single pass list processing programs
R. Alur, P. Cerny, in:, ACM, 2011, pp. 599–610.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
What’s decidable about weighted automata
S. Almagor, U. Boker, O. Kupferman, in:, Springer, 2011, pp. 482–491.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3328 | OA
A generic algebraic kernel for non linear geometric applications
E. Berberich, M. Hemmer, M. Kerber, in:, ACM, 2011, pp. 179–186.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3329 | OA
Deconstructing approximate offsets
E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–196.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3330 | OA
Root refinement for real polynomials
M. Kerber, M. Sagraloff, in:, Springer, 2011, pp. 209–216.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Journal Article | IST-REx-ID: 3332 | OA
A note on the complexity of real algebraic hypersurfaces
M. Kerber, M. Sagraloff, Graphs and Combinatorics 27 (2011) 419–430.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3334
Letter from the new editors-in-chief
H. Edelsbrunner, J. Pach, G. Ziegler, Discrete & Computational Geometry 45 (2011) 1–2.
View | DOI
 
2011 | Published | Book Chapter | IST-REx-ID: 3335 | OA
Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web
R. Van De Weygaert, G. Vegter, H. Edelsbrunner, B. Jones, P. Pranav, C. Park, W. Hellwing, B. Eldering, N. Kruithof, P. Bos, J. Hidding, J. Feldbrugge, E. Ten Have, M. Van Engelen, M. Caroli, M. Teillaud, in:, M. Gavrilova, K. Tan, M. Mostafavi (Eds.), Transactions on Computational Science XIV, Springer, 2011, pp. 60–101.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3336
Enforcing topological constraints in random field image segmentation
C. Chen, D. Freedman, C. Lampert, in:, CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–2096.
View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3337
Learning anticipation policies for robot table tennis
Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, J. Peters, in:, IEEE, 2011, pp. 332–337.
View | DOI
 
2011 | Published | Preprint | IST-REx-ID: 3338 | OA
Bounded rationality in concurrent parity games
K. Chatterjee, ArXiv (2011) 1–51.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2011 | Published | Preprint | IST-REx-ID: 3339 | OA
Magnifying lens abstraction for stochastic games with discounted and long-run average objectives
K. Chatterjee, L. De Alfaro, R. Pritam, ArXiv (2011).
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3342 | OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M.H. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3343 | OA
Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
K. Chatterjee, M.H. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3345 | OA
Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3346 | OA
Two views on multiple mean payoff objectives in Markov Decision Processes
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications

Display / Sort

Export / Embed