default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Sagraloff
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ruben Becker
, Michael Sagraloff:
Counting solutions of a polynomial system locally and exactly. J. Symb. Comput. 120: 102222 (2024)- 2022
- [j16]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): 631-697 (2022) - 2021
- [i19]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR abs/2105.05183 (2021)
2010 – 2019
- 2018
- [j15]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: 51-96 (2018) - 2017
- [c18]Gorav Jindal, Michael Sagraloff:
Efficiently Computing Real Roots of Sparse Polynomials. ISSAC 2017: 229-236 - [i18]Gorav Jindal, Michael Sagraloff:
Efficiently Computing Real Roots of Sparse Polynomials. CoRR abs/1704.06979 (2017) - [i17]Ruben Becker, Michael Sagraloff:
Counting Solutions of a Polynomial System Locally and Exactly. CoRR abs/1712.05487 (2017) - 2016
- [j14]Yacine Bouzidi, Sylvain Lazard, Guillaume Moroz, Marc Pouget, Fabrice Rouillier, Michael Sagraloff:
Solving bivariate systems using Rational Univariate Representations. J. Complex. 37: 34-75 (2016) - [j13]Michael Sagraloff, Kurt Mehlhorn:
Computing real roots of real polynomials. J. Symb. Comput. 73: 46-86 (2016) - [c17]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC 2016: 71-78 - [c16]Cornelius Brand, Michael Sagraloff:
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. ISSAC 2016: 151-158 - [c15]Alexander Kobel, Fabrice Rouillier, Michael Sagraloff:
Computing Real Roots of Real Polynomials ... and now For Real! ISSAC 2016: 303-310 - [i16]Cornelius Brand, Michael Sagraloff:
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. CoRR abs/1604.08944 (2016) - [i15]Alexander Kobel, Fabrice Rouillier, Michael Sagraloff:
Computing Real Roots of Real Polynomials ... and now For Real! CoRR abs/1605.00410 (2016) - 2015
- [j12]Alexander Kobel, Michael Sagraloff:
On the complexity of computing with planar algebraic curves. J. Complex. 31(2): 206-236 (2015) - [j11]Michael Kerber, Michael Sagraloff:
Root refinement for real polynomials using quadratic interval refinement. J. Comput. Appl. Math. 280: 377-395 (2015) - [j10]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation with application to cylindrical algebraic decomposition. J. Symb. Comput. 66: 34-69 (2015) - [i14]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 abs/1509.06231 (2015) - 2014
- [j9]Michael Sagraloff:
On the complexity of the Descartes method when using approximate arithmetic. J. Symb. Comput. 65: 79-110 (2014) - [c14]Michael Sagraloff:
A near-optimal algorithm for computing real roots of sparse polynomials. ISSAC 2014: 359-366 - [i13]Alexander Kobel, Michael Sagraloff:
Improved Complexity Bounds for Computing with Planar Algebraic Curves. CoRR abs/1401.5690 (2014) - [i12]Michael Sagraloff:
A Near-Optimal Algorithm for Computing Real Roots of Sparse Polynomials. CoRR abs/1401.6011 (2014) - 2013
- [j8]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Exact symbolic-numeric computation of planar algebraic curves. Theor. Comput. Sci. 491: 1-32 (2013) - [c13]Chee Yap, Michael Sagraloff, Vikram Sharma:
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. CiE 2013: 434-444 - [c12]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From approximate factorization to root isolation. ISSAC 2013: 283-290 - [i11]Kurt Mehlhorn, Michael Sagraloff, Pengming Wang:
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition. CoRR abs/1301.4870 (2013) - [i10]Alexander Kobel, Michael Sagraloff:
Fast Approximate Polynomial Multipoint Evaluation and Applications. CoRR abs/1304.8069 (2013) - [i9]Michael Sagraloff, Kurt Mehlhorn:
Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration. CoRR abs/1308.4088 (2013) - 2012
- [j7]Michael Kerber, Michael Sagraloff:
A worst-case bound for topology computation of algebraic curves. J. Symb. Comput. 47(3): 239-258 (2012) - [c11]Pavel Emeliyanenko, Michael Sagraloff:
On the complexity of solving a bivariate polynomial system. ISSAC 2012: 154-161 - [c10]Michael Sagraloff:
When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial. ISSAC 2012: 297-304 - [i8]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Exact Symbolic-Numeric Computation of Planar Algebraic Curves. CoRR abs/1201.1548 (2012) - 2011
- [j6]Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff:
A general approach to the analysis of controlled perturbation algorithms. Comput. Geom. 44(9): 507-528 (2011) - [j5]Michael Kerber, Michael Sagraloff:
A Note on the Complexity of Real Algebraic Hypersurfaces. Graphs Comb. 27(3): 419-430 (2011) - [j4]Kurt Mehlhorn, Michael Sagraloff:
A deterministic algorithm for isolating real roots of a real polynomial. J. Symb. Comput. 46(1): 70-90 (2011) - [c9]Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff:
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. ALENEX 2011: 35-47 - [c8]Michael Kerber, Michael Sagraloff:
Efficient real root approximation. ISSAC 2011: 209-216 - [c7]Chee-Keng Yap, Michael Sagraloff:
A simple but exact and efficient algorithm for complex root isolation. ISSAC 2011: 353-360 - [c6]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Arrangement computation for planar algebraic curves. SNC 2011: 88-98 - [i7]Eric Berberich, Pavel Emeliyanenko, Alexander Kobel, Michael Sagraloff:
Arrangement Computation for Planar Algebraic Curves. CoRR abs/1103.4697 (2011) - [i6]Michael Kerber, Michael Sagraloff:
Root Refinement for Real Polynomials. CoRR abs/1104.1362 (2011) - [i5]Michael Kerber, Michael Sagraloff:
A Worst-case Bound for Topology Computation of Algebraic Curves. CoRR abs/1104.1510 (2011) - [i4]Pavel Emeliyanenko, Michael Sagraloff:
On the Complexity of Solving a Bivariate Polynomial System. CoRR abs/1104.4954 (2011) - [i3]Michael Sagraloff:
When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial. CoRR abs/1109.6279 (2011) - 2010
- [j3]Eric Berberich, Michael Kerber, Michael Sagraloff:
An efficient algorithm for the stratification and triangulation of an algebraic surface. Comput. Geom. 43(3): 257-278 (2010) - [j2]Michael Sagraloff:
A General Approach to Isolating Roots of a Bitstream Polynomial. Math. Comput. Sci. 4(4): 481-506 (2010) - [i2]Eric Berberich, Pavel Emeliyanenko, Michael Sagraloff:
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks. CoRR abs/1010.1386 (2010) - [i1]Michael Sagraloff:
On the Complexity of Real Root Isolation. CoRR abs/1011.0344 (2010)
2000 – 2009
- 2009
- [j1]Eric Berberich, Michael Sagraloff:
A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces. Comput. Aided Geom. Des. 26(6): 627-647 (2009) - [c5]Kurt Mehlhorn, Michael Sagraloff:
Isolating real roots of real polynomials. ISSAC 2009: 247-254 - [c4]Pavel Emeliyanenko, Eric Berberich, Michael Sagraloff:
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast. ISVC (1) 2009: 608-619 - 2008
- [c3]Eric Berberich, Michael Kerber, Michael Sagraloff:
Exact geometric-topological analysis of algebraic surfaces. SCG 2008: 164-173 - [c2]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: 171-182 - 2006
- [c1]Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff:
Reliable and Efficient Computational Geometry Via Controlled Perturbation. ICALP (1) 2006: 299-310
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
