Michael Sagraloff

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 14

Top Topics

Complexity Bounds

Algebraic Curves

Top Venues

J. Symb. Comput.

Publications

Ruben Becker, Michael Sagraloff
Counting solutions of a polynomial system locally and exactly. J. Symb. Comput. 120 (2024)
Daouda Niang Diatta, Sény Diatta, Fabrice Rouillier, Marie-Françoise Roy, Michael Sagraloff
Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology. Discret. Comput. Geom. 67 (3) (2022)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR (2021)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86 (2018)
Ruben Becker, Michael Sagraloff
Counting Solutions of a Polynomial System Locally and Exactly. CoRR (2017)
Gorav Jindal, Michael Sagraloff
Efficiently Computing Real Roots of Sparse Polynomials. CoRR (2017)
Gorav Jindal, Michael Sagraloff
Efficiently Computing Real Roots of Sparse Polynomials. ISSAC (2017)
Cornelius Brand, Michael Sagraloff
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. ISSAC (2016)
Alexander Kobel, Fabrice Rouillier, Michael Sagraloff
Computing Real Roots of Real Polynomials ... and now For Real! ISSAC (2016)
Michael Sagraloff, Kurt Mehlhorn
Computing real roots of real polynomials. J. Symb. Comput. 73 (2016)
Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff
Solving bivariate systems using Rational Univariate Representations. J. Complex. 37 (2016)
Alexander Kobel, Fabrice Rouillier, Michael Sagraloff
Computing Real Roots of Real Polynomials ... and now For Real! CoRR (2016)
Cornelius Brand, Michael Sagraloff
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. CoRR (2016)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC (2016)
Michael Kerber, Michael Sagraloff
Root refinement for real polynomials using quadratic interval refinement. J. Comput. Appl. Math. 280 (2015)
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR (2015)
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. 66 (2015)
Alexander Kobel, Michael Sagraloff
On the complexity of computing with planar algebraic curves. J. Complex. 31 (2) (2015)
Michael Sagraloff
On the complexity of the Descartes method when using approximate arithmetic. J. Symb. Comput. 65 (2014)
Alexander Kobel, Michael Sagraloff
Improved Complexity Bounds for Computing with Planar Algebraic Curves. CoRR (2014)
Michael Sagraloff
A near-optimal algorithm for computing real roots of sparse polynomials. ISSAC (2014)
Michael Sagraloff
A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials. CoRR (2014)
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
From approximate factorization to root isolation. ISSAC (2013)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
Exact symbolic-numeric computation of planar algebraic curves. Theor. Comput. Sci. 491 (2013)
Chee Yap, Michael Sagraloff, Vikram Sharma
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. CiE (2013)
Michael Sagraloff, Kurt Mehlhorn
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. CoRR (2013)
Alexander Kobel, Michael Sagraloff
Fast Approximate Polynomial Multipoint Evaluation and Applications CoRR (2013)
Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition CoRR (2013)
Michael Sagraloff
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial. ISSAC (2012)
Pavel Emeliyanenko, Michael Sagraloff
On the complexity of solving a bivariate polynomial system. ISSAC (2012)
Michael Kerber, Michael Sagraloff
A worst-case bound for topology computation of algebraic curves. J. Symb. Comput. 47 (3) (2012)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
Exact Symbolic-Numeric Computation of Planar Algebraic Curves CoRR (2012)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
Arrangement Computation for Planar Algebraic Curves CoRR (2011)
Michael Kerber, Michael Sagraloff
A Worst-case Bound for Topology Computation of Algebraic Curves CoRR (2011)
Michael Kerber, Michael Sagraloff
Efficient real root approximation. ISSAC (2011)
Kurt Mehlhorn, Michael Sagraloff
A deterministic algorithm for isolating real roots of a real polynomial. J. Symb. Comput. 46 (1) (2011)
Chee-Keng Yap, Michael Sagraloff
A simple but exact and efficient algorithm for complex root isolation. ISSAC (2011)
Pavel Emeliyanenko, Michael Sagraloff
On the Complexity of Solving a Bivariate Polynomial System CoRR (2011)
Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff
Arrangement computation for planar algebraic curves. SNC (2011)
Michael Sagraloff
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial CoRR (2011)
Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. ALENEX (2011)
Michael Kerber, Michael Sagraloff
Root Refinement for Real Polynomials CoRR (2011)
Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. 44 (9) (2011)
Michael Kerber, Michael Sagraloff
A Note on the Complexity of Real Algebraic Hypersurfaces. Graphs Comb. 27 (3) (2011)
Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks CoRR (2010)
Michael Sagraloff
A General Approach to Isolating Roots of a Bitstream Polynomial. Math. Comput. Sci. 4 (4) (2010)
Eric Berberich, Michael Kerber, Michael Sagraloff
An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. 43 (3) (2010)
Michael Sagraloff
On the Complexity of Real Root Isolation CoRR (2010)
Pavel Emeliyanenko, Eric Berberich, Michael Sagraloff
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast. ISVC (1) (2009)
Eric Berberich, Michael Sagraloff
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Comput. Aided Geom. Des. 26 (6) (2009)
Kurt Mehlhorn, Michael Sagraloff
Isolating real roots of real polynomials. ISSAC (2009)
Eric Berberich, Michael Sagraloff
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Symposium on Solid and Physical Modeling (2008)
Eric Berberich, Michael Kerber, Michael Sagraloff
Exact geometric-topological analysis of algebraic surfaces. SCG (2008)
Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) (2006)