default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArnold Schönhage
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j15]Arnold Schönhage:
Polynomial root separation examples. J. Symb. Comput. 41(10): 1080-1090 (2006)- 2003
- [c10]Arnold Schönhage:
Adaptive Raising Strategies Optimizing Relative Efficiency. ICALP 2003: 611-623 - 2000
- [j14]Arnold Schönhage:
Variations on computing reciprocals of power series. Inf. Process. Lett. 74(1-2): 41-46 (2000)
1990 – 1999
- 1998
- [c9]Arnold Schönhage:
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method. FOCS 1998: 212-217 - 1995
- [c8]Arnold Schönhage:
Bivariate Polynomial Multiplication Patterns. AAECC 1995: 70-81 - 1994
- [b2]Arnold Schönhage, Andreas F. Grotefeld, Ekkehart Vetter:
Fast algorithms - a multitape Turing machine implementation. BI-Wissenschaftsverlag 1994, ISBN 978-3-86025-543-8, pp. I-X, 1-297 - [c7]Arnold Schönhage, Ekkehart Vetter:
A New Approach to Resultant Computations and Other Algorithms with Exact Division. ESA 1994: 448-459 - 1993
- [c6]Arnold Schönhage:
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic. ICALP 1993: 410-417 - 1991
- [c5]Arnold Schönhage:
Fast Reduction and Composition of Binary Quadratic Forms. ISSAC 1991: 128-133
1980 – 1989
- 1988
- [j13]Arnold Schönhage:
A nonlinear lower bound for random-access machines under logarithmic cost. J. ACM 35(3): 748-754 (1988) - [j12]Arnold Schönhage:
Probabilistic Computation of Integer Polynomial GCDs. J. Algorithms 9(3): 365-371 (1988) - 1985
- [j11]Arnold Schönhage:
Quasi-GCD computations. J. Complex. 1(1): 118-137 (1985) - 1984
- [c4]Arnold Schönhage:
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm. ICALP 1984: 436-447 - 1982
- [b1]Arnold Schönhage:
The fundamental theorem of algebra in terms of computational complexity - preliminary report. Universität Tübingen 1982, pp. 1-49 - [c3]Arnold Schönhage:
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients. EUROCAM 1982: 3-15 - 1981
- [j10]Arnold Schönhage:
Partial and Total Matrix Multiplication. SIAM J. Comput. 10(3): 434-455 (1981) - 1980
- [j9]Arnold Schönhage:
Storage Modification Machines. SIAM J. Comput. 9(3): 490-508 (1980)
1970 – 1979
- 1979
- [c2]Arnold Schönhage:
On the Power of Random Access Machines. ICALP 1979: 520-529 - [c1]Arnold Schönhage:
Storage Modification Machines. Theoretical Computer Science 1979: 36-37 - 1978
- [j8]Donald E. Knuth, Arnold Schönhage:
The Expected Linearity of a Simple Equivalence Algorithm. Theor. Comput. Sci. 6: 281-315 (1978) - 1977
- [j7]Arnold Schönhage:
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Informatica 7: 395-398 (1977) - 1976
- [j6]Arnold Schönhage, Mike Paterson, Nicholas Pippenger:
Finding the Median. J. Comput. Syst. Sci. 13(2): 184-199 (1976) - [j5]Arnold Schönhage:
An Elementary Proof for Strassen's Degree Bound. Theor. Comput. Sci. 3(2): 267-272 (1976) - 1975
- [j4]Arnold Schönhage:
A Lower Bound for the Length of Addition Chains. Theor. Comput. Sci. 1(1): 1-12 (1975) - 1971
- [j3]Arnold Schönhage:
Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica 1: 139-144 (1971) - [j2]Arnold Schönhage, Volker Strassen:
Schnelle Multiplikation großer Zahlen. Computing 7(3-4): 281-292 (1971)
1960 – 1969
- 1966
- [j1]Arnold Schönhage:
Multiplikation großer Zahlen. Computing 1(3): 182-196 (1966)
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-05-02 20:59 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:
