Skip to content

Michael Sagraloff

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

15

Venues

5

Active years

2006–2017

Best venue rank

A*

Where they publish

Papers

15 indexed papers, newest first.

YearVenueTitleAuthors
2017ISSACEfficiently Computing Real Roots of Sparse Polynomials.Gorav Jindal, Michael Sagraloff
2016ISSACComplexity Analysis of Root Clustering for a Complex Polynomial.Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
2016ISSACOn the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection.Cornelius Brand, Michael Sagraloff
2016ISSACComputing Real Roots of Real Polynomials ... and now For Real!Alexander Kobel, Fabrice Rouillier, Michael Sagraloff
2014ISSACA near-optimal algorithm for computing real roots of sparse polynomials.Michael Sagraloff
2013CiEAnalytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.Chee Yap, Michael Sagraloff, Vikram Sharma
2013ISSACFrom approximate factorization to root isolation.Kurt Mehlhorn, Michael Sagraloff, Pengming Wang
2012ISSACOn the complexity of solving a bivariate polynomial system.Pavel Emeliyanenko, Michael Sagraloff
2012ISSACWhen Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial.Michael Sagraloff
2011ALENEXAn Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks.Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff
2011ISSACEfficient real root approximation.Michael Kerber, Michael Sagraloff
2011ISSACA simple but exact and efficient algorithm for complex root isolation.Chee-Keng Yap, Michael Sagraloff
2009ISSACIsolating real roots of real polynomials.Kurt Mehlhorn, Michael Sagraloff
2009ISVCVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast.Pavel Emeliyanenko, Eric Berberich, Michael Sagraloff
2006ICALPReliable and Efficient Computational Geometry Via Controlled Perturbation.Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff