Dierk Schleicher
Orcid: 0000-0002-7586-6189
According to our database1,
Dierk Schleicher
authored at least 16 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Newton's method in practice, II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees.
J. Comput. Appl. Math., February, 2024
2022
Math. Comput., November, 2022
2020
2019
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019
2017
Newton's method in practice: Finding all roots of polynomials of degree one million efficiently.
Theor. Comput. Sci., 2017
2016
Math. Comput., 2016
2013
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method.
Math. Comput., 2013
2011
Am. Math. Mon., 2011
2007
2003
On Multicorns and unicorns I: Antiholomorphic Dynamics, Hyperbolic Components and Real cubic Polynomials.
Int. J. Bifurc. Chaos, 2003
1999