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.

2940 Publications


2011 | Journal Article | IST-REx-ID: 3334
H. Edelsbrunner, J. Pach, and G. Ziegler, “Letter from the new editors-in-chief,” Discrete & Computational Geometry, vol. 45, no. 1, pp. 1–2, 2011.
View | DOI
 

2011 | Book Chapter | IST-REx-ID: 3335 | OA
R. Van De Weygaert et al., “Alpha, Betti and the Megaparsec Universe: On the topology of the Cosmic Web,” in Transactions on Computational Science XIV, vol. 6970, M. Gavrilova, K. Tan, and M. Mostafavi, Eds. Springer, 2011, pp. 60–101.
View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3336
C. Chen, D. Freedman, and C. Lampert, “Enforcing topological constraints in random field image segmentation,” in CVPR: Computer Vision and Pattern Recognition, Colorado Springs, CO, USA, 2011, pp. 2089–2096.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3337
Z. Wang, C. Lampert, K. Mülling, B. Schölkopf, and J. Peters, “Learning anticipation policies for robot table tennis,” presented at the IROS: RSJ International Conference on Intelligent Robots and Systems, San Francisco, USA, 2011, pp. 332–337.
View | DOI
 

2011 | Preprint | IST-REx-ID: 3338 | OA
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
View | Files available | Download Preprint (ext.) | arXiv
 

2011 | Preprint | IST-REx-ID: 3339 | OA
K. Chatterjee, L. De Alfaro, and R. Pritam, “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
K. Chatterjee, M. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3343 | OA
K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, USA, 2011, pp. 1318–1336.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3344
K. Chatterjee, “Graph games with reachability objectives,” presented at the RP: Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3345 | OA
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

extern<>1

Search

Filter Publications