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.

2527 Publications


2011 | Conference Paper | IST-REx-ID: 3324 | OA
R. Piskac and T. Wies, “Decision procedures for automating termination proofs,” presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA, 2011, vol. 6538, pp. 371–386.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3326 | OA
S. Almagor, U. Boker, and O. Kupferman, “What’s decidable about weighted automata ,” presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan, 2011, vol. 6996, pp. 482–491.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3328 | OA
E. Berberich, M. Hemmer, and M. Kerber, “A generic algebraic kernel for non linear geometric applications,” presented at the SCG: Symposium on Computational Geometry, Paris, France, 2011, pp. 179–186.
View | DOI | Download Published Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3329 | OA
E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Deconstructing approximate offsets,” in Proceedings of the twenty-seventh annual symposium on Computational geometry, Paris, France, 2011, pp. 187–196.
View | Files available | DOI | Download Preprint (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3330 | OA
M. Kerber and M. Sagraloff, “Root refinement for real polynomials,” presented at the ISSAC: International Symposium on Symbolic and Algebraic Computation, California, USA, 2011, pp. 209–216.
View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3332 | OA
M. Kerber and M. Sagraloff, “A note on the complexity of real algebraic hypersurfaces,” Graphs and Combinatorics, vol. 27, no. 3. Springer, pp. 419–430, 2011.
View | Files available | 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 | 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
 

Filters and Search Terms

oa=1

extern<>1

Search

Filter Publications