Michael Sagraloff

54 papers A 1B 11C 1Journal 36Unranked 5

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