Dierk Schleicher

Orcid: 0000-0002-7586-6189

According to our database1, Dierk Schleicher authored at least 16 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

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
The Weierstrass-Durand-Kerner root finder is not generally convergent.
Math. Comput., November, 2022

Mathematical Proof Between Generations.
CoRR, 2022

Diophantine Equations and the DPRM Theorem.
Arch. Formal Proofs, 2022

2020
The Weierstrass root finder is not generally convergent.
CoRR, 2020

Finding polynomial roots by dynamical systems - a case study.
CoRR, 2020

2019
The DPRM Theorem in Isabelle (Short Paper).
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
On the speed of convergence of Newton's method for complex polynomials.
Math. Comput., 2016

2013
Letter from the Guest Editors.
Am. Math. Mon., 2013

New Looks at Old Number Theory.
Am. Math. Mon., 2013

A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method.
Math. Comput., 2013

2011
How to Add a Noninteger Number of Terms: From Axioms to New Identities.
Am. Math. Mon., 2011

2007
Hausdorff Dimension, Its Properties, and Its Surprises.
Am. Math. Mon., 2007

2003
On Multicorns and unicorns I: Antiholomorphic Dynamics, Hyperbolic Components and Real cubic Polynomials.
Int. J. Bifurc. Chaos, 2003

1999
The 3n+l-Problem and Holomorphic Dynamics.
Exp. Math., 1999


  Loading...