Please note that IST 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.

2889 Publications


2011 | Conference Poster | IST-REx-ID: 3322
Lampert, Christoph. “Maximum Margin Multi Label Structured Prediction.” NIPS: Neural Information Processing Systems, Neural Information Processing Systems, 2011.
View | Files available
 

2011 | Conference Paper | IST-REx-ID: 3323
Wies, Thomas, et al. An Efficient Decision Procedure for Imperative Tree Data Structures. Vol. 6803, Springer, 2011, pp. 476–91, doi:10.1007/978-3-642-22438-6_36.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3324 | OA
Piskac, Ruzica, and Thomas Wies. Decision Procedures for Automating Termination Proofs. Edited by Ranjit Jhala and David Schmidt, vol. 6538, Springer, 2011, pp. 371–86, doi:10.1007/978-3-642-18275-4_26.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3325
Alur, Rajeev, and Pavol Cerny. Streaming Transducers for Algorithmic Verification of Single Pass List Processing Programs. Vol. 46, no. 1, ACM, 2011, pp. 599–610, doi:10.1145/1926385.1926454.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3326 | OA
Almagor, Shaull, et al. What’s Decidable about Weighted Automata . Vol. 6996, Springer, 2011, pp. 482–91, doi:10.1007/978-3-642-24372-1_37.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3328 | OA
Berberich, Eric, et al. A Generic Algebraic Kernel for Non Linear Geometric Applications. ACM, 2011, pp. 179–86, doi:10.1145/1998196.1998224.
View | DOI | Download Published Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3329 | OA
Berberich, Eric, et al. “Deconstructing Approximate Offsets.” Proceedings of the Twenty-Seventh Annual Symposium on Computational Geometry, ACM, 2011, pp. 187–96, doi:10.1145/1998196.1998225.
View | Files available | DOI | Download Preprint (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3330 | OA
Kerber, Michael, and Michael Sagraloff. Root Refinement for Real Polynomials. Springer, 2011, pp. 209–16, doi:10.1145/1993886.1993920.
View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3332 | OA
Kerber, Michael, and Michael Sagraloff. “A Note on the Complexity of Real Algebraic Hypersurfaces.” Graphs and Combinatorics, vol. 27, no. 3, Springer, 2011, pp. 419–30, doi:10.1007/s00373-011-1020-7.
View | Files available | DOI
 

2011 | Journal Article | IST-REx-ID: 3334
Edelsbrunner, Herbert, et al. “Letter from the New Editors-in-Chief.” Discrete & Computational Geometry, vol. 45, no. 1, Springer, 2011, pp. 1–2, doi:10.1007/s00454-010-9313-9.
View | DOI
 

2011 | Book Chapter | IST-REx-ID: 3335 | OA
Van De Weygaert, Rien, et al. “Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web.” Transactions on Computational Science XIV, edited by Marina Gavrilova et al., vol. 6970, Springer, 2011, pp. 60–101, doi:10.1007/978-3-642-25249-5_3.
View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3336
Chen, Chao, et al. “Enforcing Topological Constraints in Random Field Image Segmentation.” CVPR: Computer Vision and Pattern Recognition, IEEE, 2011, pp. 2089–96, doi:10.1109/CVPR.2011.5995503.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3337
Wang, Zhikun, et al. Learning Anticipation Policies for Robot Table Tennis. IEEE, 2011, pp. 332–37, doi:10.1109/IROS.2011.6094892.
View | DOI
 

2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv, ArXiv, 2011, pp. 1–51.
View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Preprint | IST-REx-ID: 3339 | OA
Chatterjee, Krishnendu, et al. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv, ArXiv, 2011.
View | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee, Krishnendu, and Monika Henzinger. Faster and Dynamic Algorithms for Maximal End Component Decomposition and Related Graph Problems in Probabilistic Verification. SIAM, 2011, pp. 1318–36, doi:10.1137/1.9781611973082.101.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee, Krishnendu. Graph Games with Reachability Objectives. Edited by Giorgo Delzanno and Igor Potapov, vol. 6945, Springer, 2011, pp. 1–1, doi:10.1007/978-3-642-24288-5_1.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10.
View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

extern<>1

Search

Filter Publications