Michael Sagraloff

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Counting solutions of a polynomial system locally and exactly Journal of Symbolic Computation	2023-08-10	Paper
Bounds for polynomials on algebraic numbers and application to curve topology Discrete & Computational Geometry	2022-03-22	Paper
Efficiently Computing Real Roots of Sparse Polynomials Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation	2020-09-09	Paper
An elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX)	2019-09-12	Paper
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration Journal of Symbolic Computation	2017-11-22	Paper
Computing Real Roots of Real Polynomials ... and now For Real! Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation	2017-05-10	Paper
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation	2017-05-10	Paper
From approximate factorization to root isolation Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation	2017-02-10	Paper
Solving bivariate systems using rational univariate representations Journal of Complexity	2016-10-17	Paper
Arrangement computation for planar algebraic curves Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation	2016-09-29	Paper
A near-optimal algorithm for computing real roots of sparse polynomials Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation	2015-11-11	Paper
Computing real roots of real polynomials Journal of Symbolic Computation	2015-08-24	Paper
A simple but exact and efficient algorithm for complex root isolation Proceedings of the 36th international symposium on Symbolic and algebraic computation	2015-06-09	Paper
Efficient real root approximation Proceedings of the 36th international symposium on Symbolic and algebraic computation	2015-06-09	Paper
On the complexity of solving a bivariate polynomial system Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation	2015-03-27	Paper
When Newton meets Descartes Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation	2015-03-27	Paper
On the complexity of computing with planar algebraic curves Journal of Complexity	2015-02-06	Paper
Root refinement for real polynomials using quadratic interval refinement Journal of Computational and Applied Mathematics	2015-01-08	Paper
From approximate factorization to root isolation with application to cylindrical algebraic decomposition Journal of Symbolic Computation	2014-07-16	Paper
On the complexity of the Descartes method when using approximate arithmetic Journal of Symbolic Computation	2014-04-28	Paper
Exact symbolic-numeric computation of planar algebraic curves Theoretical Computer Science	2013-12-17	Paper
Analytic root clustering: a complete algorithm using soft zero tests Lecture Notes in Computer Science	2013-08-05	Paper
Fast Approximate Polynomial Multipoint Evaluation and Applications	2013-04-30	Paper
Isolating real roots of real polynomials Proceedings of the 2009 international symposium on Symbolic and algebraic computation	2012-05-13	Paper
A worst-case bound for topology computation of algebraic curves Journal of Symbolic Computation	2012-03-22	Paper
A note on the complexity of real algebraic hypersurfaces Graphs and Combinatorics	2012-01-24	Paper
A general approach to isolating roots of a bitstream polynomial Mathematics in Computer Science	2012-01-02	Paper
A general approach to the analysis of controlled perturbation algorithms Computational Geometry	2011-12-28	Paper
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces Computer Aided Geometric Design	2011-02-15	Paper
A deterministic algorithm for isolating real roots of a real polynomial Journal of Symbolic Computation	2010-11-19	Paper
Certified complex root isolation via adaptive root separation bounds	2010-03-10	Paper
An efficient algorithm for the stratification and triangulation of an algebraic surface Computational Geometry	2009-11-16	Paper
Reliable and Efficient Computational Geometry Via Controlled Perturbation Automata, Languages and Programming	2009-03-12	Paper
Exact geometric-topological analysis of algebraic surfaces Proceedings of the twenty-fourth annual symposium on Computational geometry	2009-02-12	Paper
Special Linear Series and Syzygies of Canonical Curves of Genus 9	2006-05-30	Paper

Research outcomes over time

This page was built for person: Michael Sagraloff