default search action
Dierk Schleicher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Marvin Randig, Dierk Schleicher
, Robin Stoll
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. 437: 115427 (2024) - 2022
- [j11]Jonas Bayer, Marco David, Benedikt Stock, Abhik Pal, Yuri V. Matiyasevich, Dierk Schleicher:
Diophantine Equations and the DPRM Theorem. Arch. Formal Proofs 2022 (2022) - [j10]Bernhard Reinke, Dierk Schleicher, Michael Stoll:
The Weierstrass-Durand-Kerner root finder is not generally convergent. Math. Comput. 92(340): 839-866 (2022) - [i4]Jonas Bayer, Christoph Benzmüller
Mathematical Proof Between Generations. CoRR abs/2207.04779 (2022) - 2020
- [i3]Sergey Shemyakov, Roman Chernov, Dzmitry Rumiantsau, Dierk Schleicher, Simon Schmitt, Anton Shemyakov:
Finding polynomial roots by dynamical systems - a case study. CoRR abs/2004.03217 (2020) - [i2]Bernhard Reinke, Dierk Schleicher, Michael Stoll:
The Weierstrass root finder is not generally convergent. CoRR abs/2004.04777 (2020)
2010 – 2019
- 2019
- [c1]Jonas Bayer, Marco David, Abhik Pal
The DPRM Theorem in Isabelle (Short Paper). ITP 2019: 33:1-33:7 - 2017
- [j9]Dierk Schleicher, Robin Stoll
Newton's method in practice: Finding all roots of polynomials of degree one million efficiently. Theor. Comput. Sci. 681: 146-166 (2017) - 2016
- [j8]Todor Bilarev, Magnus Aspenberg, Dierk Schleicher:
On the speed of convergence of Newton's method for complex polynomials. Math. Comput. 85(298): 693-705 (2016) - 2015
- [i1]Dierk Schleicher, Robin Stoll
Newton's method in practice: finding all roots of polynomials of degree one million efficiently. CoRR abs/1508.02935 (2015) - 2013
- [j7]Béla Bollobás, Malte Lackmann, Dierk Schleicher
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. Math. Comput. 82(281): 443-457 (2013) - [j6]Dierk Schleicher
Letter from the Guest Editors. Am. Math. Mon. 120(3): 191 (2013) - [j5]Aimeric Malter, Dierk Schleicher
New Looks at Old Number Theory. Am. Math. Mon. 120(3): 243-264 (2013) - 2011
- [j4]Markus Müller, Dierk Schleicher
How to Add a Noninteger Number of Terms: From Axioms to New Identities. Am. Math. Mon. 118(2): 136-152 (2011)
2000 – 2009
- 2007
- [j3]Dierk Schleicher:
Hausdorff Dimension, Its Properties, and Its Surprises. Am. Math. Mon. 114(6): 509-528 (2007) - 2003
- [j2]Shizuo Nakane, Dierk Schleicher
On Multicorns and unicorns I: Antiholomorphic Dynamics, Hyperbolic Components and Real cubic Polynomials. Int. J. Bifurc. Chaos 13(10): 2825-2844 (2003)
1990 – 1999
- 1999
- [j1]Simon Letherman, Dierk Schleicher, Reg Wood:
The 3n+l-Problem and Holomorphic Dynamics. Exp. Math. 8(3): 241-251 (1999)
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 22:53 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: