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.




2825 Publications

2011 | Conference Paper | IST-REx-ID: 3329 | OA
Berberich E, Halperin D, Kerber M, Pogalnikova R. 2011. Deconstructing approximate offsets. Proceedings of the twenty-seventh annual symposium on Computational geometry. SCG: Symposium on Computational Geometry 187–196.
View | Files available | DOI | Download Preprint (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3330 | OA
Kerber M, Sagraloff M. 2011. Root refinement for real polynomials. ISSAC: International Symposium on Symbolic and Algebraic Computation 209–216.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3332 | OA
Kerber M, Sagraloff M. 2011. A note on the complexity of real algebraic hypersurfaces. Graphs and Combinatorics. 27(3), 419–430.
View | Files available | DOI
 
2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner H, Pach J, Ziegler G. 2011. Letter from the new editors-in-chief. Discrete & Computational Geometry. 45(1), 1–2.
View | DOI
 
2011 | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert R, Vegter G, Edelsbrunner H, Jones B, Pranav P, Park C, Hellwing W, Eldering B, Kruithof N, Bos P, Hidding J, Feldbrugge J, Ten Have E, Van Engelen M, Caroli M, Teillaud M. 2011. Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web. Transactions on Computational Science XIV. Special Issue on Voronoi Diagrams and Delaunay Triangulation, LNCS, vol. 6970. 60–101.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3336
Chen C, Freedman D, Lampert C. 2011. Enforcing topological constraints in random field image segmentation. CVPR: Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition 2089–2096.
View | Files available | DOI
 
2011 | 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. IROS: RSJ International Conference on Intelligent Robots and Systems 332–337.
View | DOI
 
2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv., 1–51.
View | Files available | Download Preprint (ext.) | arXiv
 
2011 | 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.
View | Download Preprint (ext.) | arXiv
 
2011 | 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. CAV: Computer Aided Verification, LNCS, vol. 6806. 260–276.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | 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. SODA: Symposium on Discrete Algorithms 1318–1336.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945. 1–1.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907. 206–218.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2011 | 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. LICS: Logic in Computer Science
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 216–226.
View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control 221–230.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54. 74–86.
View | DOI | Download Submitted Version (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919. 145–159.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914. 148–159.
View | DOI | Download Submitted Version (ext.)
 
2011 | Journal Article | IST-REx-ID: 3352
Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications of the ACM. 54(10), 72–82.
View | DOI
 

Search

Display / Sort

Citation Style: IST Annual Report

Export / Embed