Følg
Michael Sagraloff
Michael Sagraloff
University of Applied Sciences, Landshut
Verifisert e-postadresse på haw-landshut.de - Startside
Tittel
Sitert av
Sitert av
År
Computing real roots of real polynomials
M Sagraloff, K Mehlhorn
Journal of Symbolic Computation 73, 46-86, 2016
87*2016
A simple but exact and efficient algorithm for complex root isolation
CK Yap, M Sagraloff
Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011
742011
Computing Real Roots of Real Polynomials ... and now For Real!
K Alexander, F Rouillier, M Sagraloff
Proceedings of the {ACM} on International Symposium on Symbolic and …, 2016
65*2016
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
R Becker, M Sagraloff, V Sharma, C Yap
Journal of Symbolic Computation 86, 51-96, 2018
622018
From approximate factorization to root isolation with application to cylindrical algebraic decomposition
K Mehlhorn, M Sagraloff, P Wang
Journal of Symbolic Computation 66, 34-69, 2015
612015
When Newton meets Descartes: A simple and fast algorithm to isolate the real roots of a polynomial
M Sagraloff
Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012
612012
On the complexity of computing with planar algebraic curves
A Kobel, M Sagraloff
Journal of Complexity 31 (2), 206-236, 2015
51*2015
Solving bivariate systems using Rational Univariate Representations
Y Bouzidi, S Lazard, G Moroz, M Pouget, M Rouillier, Fabrice, Sagraloff
Journal of Complexity 37, 34--75, 2016
45*2016
Complexity Analysis of Root Clustering for a Complex Polynomial
R Becker, M Sagraloff, V Sharma, J Xu, C Yap
Proceedings of the {ACM} on International Symposium on Symbolic and …, 2016
442016
An elimination method for solving bivariate polynomial systems: Eliminating the usual drawbacks
E Berberich, P Emeliyanenko, M Sagraloff
2011 proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011
432011
A worst-case bound for topology computation of algebraic curves
M Kerber, M Sagraloff
Journal of Symbolic Computation 47 (3), 239-258, 2012
392012
On the complexity of solving a bivariate polynomial system
P Emeliyanenko, M Sagraloff
Proceedings of the 37th International Symposium on Symbolic and Algebraic …, 2012
382012
A deterministic algorithm for isolating real roots of a real polynomial
K Mehlhorn, M Sagraloff
Journal of Symbolic Computation 46 (1), 70-90, 2011
372011
Exact symbolic–numeric computation of planar algebraic curves
E Berberich, P Emeliyanenko, A Kobel, M Sagraloff
Theoretical Computer Science 491, 1-32, 2013
352013
An efficient algorithm for the stratification and triangulation of an algebraic surface
E Berberich, M Kerber, M Sagraloff
Computational Geometry 43 (3), 257-278, 2010
322010
Analytic root clustering: A complete algorithm using soft zero tests
C Yap, M Sagraloff, V Sharma
The Nature of Computation. Logic, Algorithms, Applications: 9th Conference …, 2013
312013
On the complexity of the Descartes method when using approximate arithmetic
M Sagraloff
Journal of Symbolic Computation 65, 79-110, 2014
30*2014
Efficient real root approximation
M Kerber, M Sagraloff
Proceedings of the 36th international symposium on Symbolic and algebraic …, 2011
30*2011
A general approach to the analysis of controlled perturbation algorithms
K Mehlhorn, R Osbild, M Sagraloff
Computational Geometry 44 (9), 507-528, 2011
292011
Exact geometric-topological analysis of algebraic surfaces
E Berberich, M Kerber, M Sagraloff
Proceedings of the twenty-fourth annual symposium on computational geometry …, 2008
292008
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20