Michael Sagraloff

Affiliations:
  • Max Planck Institute for Informatics, Saarbrücken, Germany


According to our database1, Michael Sagraloff authored at least 40 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Counting solutions of a polynomial system locally and exactly.
J. Symb. Comput., 2024

2022
Bounds for Polynomials on Algebraic Numbers and Application to Curve Topology.
Discret. Comput. Geom., 2022

2018
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput., 2018

2017
Efficiently Computing Real Roots of Sparse Polynomials.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Computing real roots of real polynomials.
J. Symb. Comput., 2016

Solving bivariate systems using Rational Univariate Representations.
J. Complex., 2016

Computing Real Roots of Real Polynomials ... and now For Real!
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

2015
From approximate factorization to root isolation with application to cylindrical algebraic decomposition.
J. Symb. Comput., 2015

Root refinement for real polynomials using quadratic interval refinement.
J. Comput. Appl. Math., 2015

On the complexity of computing with planar algebraic curves.
J. Complex., 2015

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.
CoRR, 2015

2014
On the complexity of the Descartes method when using approximate arithmetic.
J. Symb. Comput., 2014

Improved Complexity Bounds for Computing with Planar Algebraic Curves.
CoRR, 2014

A near-optimal algorithm for computing real roots of sparse polynomials.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013
Exact symbolic-numeric computation of planar algebraic curves.
Theor. Comput. Sci., 2013

Fast Approximate Polynomial Multipoint Evaluation and Applications
CoRR, 2013

Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration.
CoRR, 2013

From approximate factorization to root isolation.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
A worst-case bound for topology computation of algebraic curves.
J. Symb. Comput., 2012

When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

On the complexity of solving a bivariate polynomial system.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
A deterministic algorithm for isolating real roots of a real polynomial.
J. Symb. Comput., 2011

A Note on the Complexity of Real Algebraic Hypersurfaces.
Graphs Comb., 2011

Root Refinement for Real Polynomials
CoRR, 2011

A general approach to the analysis of controlled perturbation algorithms.
Comput. Geom., 2011

Arrangement computation for planar algebraic curves.
Proceedings of the SNC 2011, 2011

A simple but exact and efficient algorithm for complex root isolation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Efficient real root approximation.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
A General Approach to Isolating Roots of a Bitstream Polynomial.
Math. Comput. Sci., 2010

On the Complexity of Real Root Isolation
CoRR, 2010

An efficient algorithm for the stratification and triangulation of an algebraic surface.
Comput. Geom., 2010

2009
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces.
Comput. Aided Geom. Des., 2009

Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast.
Proceedings of the Advances in Visual Computing, 5th International Symposium, 2009

Isolating real roots of real polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Exact geometric-topological analysis of algebraic surfaces.
Proceedings of the 24th ACM Symposium on Computational Geometry, 2008

2006
Reliable and Efficient Computational Geometry Via Controlled Perturbation.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006


  Loading...