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.
5339 Publications
2011 | Published | Conference Paper | IST-REx-ID: 3323
Wies T, Muñiz M, Kuncak V. An efficient decision procedure for imperative tree data structures. In: Vol 6803. Springer; 2011:476-491. doi:10.1007/978-3-642-22438-6_36
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3324 | 
Piskac R, Wies T. Decision procedures for automating termination proofs. In: Jhala R, Schmidt D, eds. Vol 6538. Springer; 2011:371-386. doi: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. Streaming transducers for algorithmic verification of single pass list processing programs. In: Vol 46. ACM; 2011:599-610. doi:10.1145/1926385.1926454
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3326 |
Almagor S, Boker U, Kupferman O. What’s decidable about weighted automata . In: Vol 6996. Springer; 2011:482-491. doi:10.1007/978-3-642-24372-1_37
[Submitted Version]
View
| Files available
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3328 |
Berberich E, Hemmer M, Kerber M. A generic algebraic kernel for non linear geometric applications. In: ACM; 2011:179-186. doi:10.1145/1998196.1998224
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3329 |
Berberich E, Halperin D, Kerber M, Pogalnikova R. Deconstructing approximate offsets. In: Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry. ACM; 2011:187-196. doi:10.1145/1998196.1998225
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3330 |
Kerber M, Sagraloff M. Root refinement for real polynomials. In: Springer; 2011:209-216. doi:10.1145/1993886.1993920
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Published | Journal Article | IST-REx-ID: 3332 |
Kerber M, Sagraloff M. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 2011;27(3):419-430. doi: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. Letter from the new editors-in-chief. Discrete & Computational Geometry. 2011;45(1):1-2. doi:10.1007/s00454-010-9313-9
View
| DOI
2011 | Published | Book Chapter | IST-REx-ID: 3335 |
Van De Weygaert R, Vegter G, Edelsbrunner H, et al. Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. In: Gavrilova M, Tan K, Mostafavi M, eds. Transactions on Computational Science XIV. Vol 6970. Special Issue on Voronoi Diagrams and Delaunay Triangulation. Springer; 2011:60-101. doi: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. Enforcing topological constraints in random field image segmentation. In: CVPR: Computer Vision and Pattern Recognition. IEEE; 2011:2089-2096. doi: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. Learning anticipation policies for robot table tennis. In: IEEE; 2011:332-337. doi:10.1109/IROS.2011.6094892
View
| DOI
2011 | Published | Preprint | IST-REx-ID: 3338 |
Chatterjee K. Bounded rationality in concurrent parity games. arXiv. 2011:1-51.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 | Published | Preprint | IST-REx-ID: 3339 |
Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. 2011.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Published | Conference Paper | IST-REx-ID: 3342 |
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi: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 K, Henzinger M. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:10.1137/1.9781611973082.101
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1
View
| DOI
2011 | Published | Conference Paper | IST-REx-ID: 3345 |
Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes. In: Vol 6907. Springer; 2011:206-218. doi: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 |
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:10.1109/LICS.2011.10
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Published | Conference Paper | IST-REx-ID: 3347 |
Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv