Reliable and Efficient Computational Geometry Via Controlled Perturbation. - Kurt Mehlhorn; Ralf Osbild; Michael Sagraloff (ICALP (1), 2006)

Exact geometric-topological analysis of algebraic surfaces. - Eric Berberich; Michael Kerber; Michael Sagraloff (SCG, 2008)

Isolating real roots of real polynomials. - Kurt Mehlhorn; Michael Sagraloff (ISSAC, 2009)

Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast. - Pavel Emeliyanenko; Eric Berberich; Michael Sagraloff (ISVC (1), 2009)

A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. - Eric Berberich; Michael Sagraloff (Comput. Aided Geom. Des., 2009)

An efficient algorithm for the stratification and triangulation of an algebraic surface. - Eric Berberich; Michael Kerber; Michael Sagraloff (Comput. Geom., 2010)

On the Complexity of Real Root Isolation - Michael Sagraloff (CoRR, 2010)

A General Approach to Isolating Roots of a Bitstream Polynomial. - Michael Sagraloff (Math. Comput. Sci., 2010)

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. - Eric Berberich; Pavel Emeliyanenko; Michael Sagraloff (ALENEX, 2011)

Efficient real root approximation. - Michael Kerber; Michael Sagraloff (ISSAC, 2011)

A simple but exact and efficient algorithm for complex root isolation. - Chee-Keng Yap; Michael Sagraloff (ISSAC, 2011)

Arrangement computation for planar algebraic curves. - Eric Berberich; Pavel Emeliyanenko; Alexander Kobel; Michael Sagraloff (SNC, 2011)

A general approach to the analysis of controlled perturbation algorithms. - Kurt Mehlhorn; Ralf Osbild; Michael Sagraloff (Comput. Geom., 2011)

Root Refinement for Real Polynomials - Michael Kerber; Michael Sagraloff (CoRR, 2011)

A Note on the Complexity of Real Algebraic Hypersurfaces. - Michael Kerber; Michael Sagraloff (Graphs Comb., 2011)

A deterministic algorithm for isolating real roots of a real polynomial. - Kurt Mehlhorn; Michael Sagraloff (J. Symb. Comput., 2011)

On the complexity of solving a bivariate polynomial system. - Pavel Emeliyanenko; Michael Sagraloff (ISSAC, 2012)

When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial. - Michael Sagraloff (ISSAC, 2012)

A worst-case bound for topology computation of algebraic curves. - Michael Kerber; Michael Sagraloff (J. Symb. Comput., 2012)

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. - Chee Yap; Michael Sagraloff; Vikram Sharma 001 (CiE, 2013)

From approximate factorization to root isolation. - Kurt Mehlhorn; Michael Sagraloff; Pengming Wang 001 (ISSAC, 2013)

Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. - Michael Sagraloff; Kurt Mehlhorn (CoRR, 2013)

Fast Approximate Polynomial Multipoint Evaluation and Applications - Alexander Kobel; Michael Sagraloff (CoRR, 2013)

Exact symbolic-numeric computation of planar algebraic curves. - Eric Berberich; Pavel Emeliyanenko; Alexander Kobel; Michael Sagraloff (Theor. Comput. Sci., 2013)

A near-optimal algorithm for computing real roots of sparse polynomials. - Michael Sagraloff (ISSAC, 2014)

Improved Complexity Bounds for Computing with Planar Algebraic Curves. - Alexander Kobel; Michael Sagraloff (CoRR, 2014)

On the complexity of the Descartes method when using approximate arithmetic. - Michael Sagraloff (J. Symb. Comput., 2014)

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee-Keng Yap (CoRR, 2015)

On the complexity of computing with planar algebraic curves. - Alexander Kobel; Michael Sagraloff (J. Complex., 2015)

Root refinement for real polynomials using quadratic interval refinement. - Michael Kerber; Michael Sagraloff (J. Comput. Appl. Math., 2015)

From approximate factorization to root isolation with application to cylindrical algebraic decomposition. - Kurt Mehlhorn; Michael Sagraloff; Pengming Wang 001 (J. Symb. Comput., 2015)

Complexity Analysis of Root Clustering for a Complex Polynomial. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Juan Xu; Chee Yap (ISSAC, 2016)

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. - Cornelius Brand; Michael Sagraloff (ISSAC, 2016)

Computing Real Roots of Real Polynomials ... and now For Real! - Alexander Kobel; Fabrice Rouillier; Michael Sagraloff (ISSAC, 2016)

Solving bivariate systems using Rational Univariate Representations. - Yacine Bouzidi; Sylvain Lazard; Guillaume Moroz; Marc Pouget; Fabrice Rouillier; Michael Sagraloff (J. Complex., 2016)

Computing real roots of real polynomials. - Michael Sagraloff; Kurt Mehlhorn (J. Symb. Comput., 2016)

Efficiently Computing Real Roots of Sparse Polynomials. - Gorav Jindal; Michael Sagraloff (ISSAC, 2017)

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. - Ruben Becker; Michael Sagraloff; Vikram Sharma 001; Chee Yap (J. Symb. Comput., 2018)

Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology. - Daouda Niang Diatta; Sény Diatta; Fabrice Rouillier; Marie-Françoise Roy; Michael Sagraloff (Discret. Comput. Geom., 2022)

Counting solutions of a polynomial system locally and exactly. - Ruben Becker; Michael Sagraloff (J. Symb. Comput., 2024)