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.




5473 Publications

2011 | Published | Conference Poster | IST-REx-ID: 3322
Lampert, C. (2011). Maximum margin multi label structured prediction. NIPS: Neural Information Processing Systems. Neural Information Processing Systems Foundation.
View | Files available
 
2011 | Published | Conference Paper | IST-REx-ID: 3323
Wies, T., Muñiz, M., & Kuncak, V. (2011). An efficient decision procedure for imperative tree data structures (Vol. 6803, pp. 476–491). Presented at the CADE 23: Automated Deduction , Wrocław, Poland: Springer. https://doi.org/10.1007/978-3-642-22438-6_36
View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3324 | OA
Piskac, R., & Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala & D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer. 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, R., & Cerny, P. (2011). Streaming transducers for algorithmic verification of single pass list processing programs (Vol. 46, pp. 599–610). Presented at the POPL: Principles of Programming Languages, Texas, USA: ACM. https://doi.org/10.1145/1926385.1926454
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3326 | OA
Almagor, S., Boker, U., & Kupferman, O. (2011). What’s decidable about weighted automata (Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer. 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 | OA
Berberich, E., Hemmer, M., & Kerber, M. (2011). A generic algebraic kernel for non linear geometric applications (pp. 179–186). Presented at the SCG: Symposium on Computational Geometry, Paris, France: ACM. https://doi.org/10.1145/1998196.1998224
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3329 | OA
Berberich, E., Halperin, D., Kerber, M., & Pogalnikova, R. (2011). Deconstructing approximate offsets. In Proceedings of the twenty-seventh annual symposium on Computational geometry (pp. 187–196). Paris, France: ACM. https://doi.org/10.1145/1998196.1998225
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3330 | OA
Kerber, M., & Sagraloff, M. (2011). Root refinement for real polynomials (pp. 209–216). Presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA: Springer. https://doi.org/10.1145/1993886.1993920
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Journal Article | IST-REx-ID: 3332 | OA
Kerber, M., & Sagraloff, M. (2011). A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. Springer. https://doi.org/10.1007/s00373-011-1020-7
[Submitted Version] View | Files available | DOI
 
2011 | Published | Journal Article | IST-REx-ID: 3334
Edelsbrunner, H., Pach, J., & Ziegler, G. (2011). Letter from the new editors-in-chief. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-010-9313-9
View | DOI
 
2011 | Published | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B., Pranav, P., Park, C., … Teillaud, M. (2011). Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In M. Gavrilova, K. Tan, & M. Mostafavi (Eds.), Transactions on Computational Science XIV (Vol. 6970, pp. 60–101). Springer. 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, C., Freedman, D., & Lampert, C. (2011). Enforcing topological constraints in random field image segmentation. In CVPR: Computer Vision and Pattern Recognition (pp. 2089–2096). Colorado Springs, CO, United States: IEEE. https://doi.org/10.1109/CVPR.2011.5995503
View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3337
Wang, Z., Lampert, C., Mülling, K., Schölkopf, B., & Peters, J. (2011). Learning anticipation policies for robot table tennis (pp. 332–337). Presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA: IEEE. https://doi.org/10.1109/IROS.2011.6094892
View | DOI
 
2011 | Published | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. arXiv. ArXiv.
[Preprint] View | Files available | Download Preprint (ext.) | arXiv
 
2011 | Published | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, K., De Alfaro, L., & Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. 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 | OA
Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM. https://doi.org/10.1137/1.9781611973082.101
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee, K. (2011). Graph games with reachability objectives. In G. Delzanno & I. Potapov (Eds.) (Vol. 6945, pp. 1–1). Presented at the RP: Reachability Problems, Genoa, Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1
View | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed