Arnold Schönhage

Q: What Schools Are Affiliated With Arnold Schönhage

Arnold Schönhage is affiliated with the following schools: University of Göttingen, University of Konstanz, University of Cologne, University of Tübingen, University of Bonn

Arnold Schönhage's AcademicInfluence.com Rankings

Arnold Schönhage

Mathematics

#1237

World Rank

#2074

Historical Rank

Measure Theory

#2722

World Rank

#3251

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Arnold Schönhage's Degrees

PhD Mathematics University of Göttingen

Why Is Arnold Schönhage Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Arnold Schönhage is a German mathematician and computer scientist. Schönhage was professor at the Rheinische Friedrich-Wilhelms-Universität, Bonn, and also in Tübingen and Konstanz. Together with Volker Strassen, he developed the Schönhage–Strassen algorithm for the multiplication of large numbers that has a runtime of O. For many years, this was the fastest way to multiply large integers, although Schönhage and Strassen predicted that an algorithm with a run-time of N should exist. In 2019, Joris van der Hoeven and David Harvey finally developed an algorithm with this runtime, proving that Schönhage's and Strassen's prediction had been correct.

(See a Problem?)

Arnold Schönhage's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Schnelle Multiplikation großer Zahlen (1971) (729)
Partial and Total Matrix Multiplication (1981) (250)
Storage Modification Machines (1979) (228)
The fundamental theorem of algebra in terms of computational complexity - preliminary report (1982) (222)
Finding the Median (1976) (207)
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2 (1977) (167)
Fast algorithms for multiple evaluations of the riemann zeta function (1988) (145)
Quasi-GCD computations (1985) (136)
Schnelle Berechnung von Kettenbruchentwicklungen (1971) (133)
On the Power of Random Access Machines (1979) (117)
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients (1982) (109)
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm (1984) (106)
Fast algorithms - a multitape Turing machine implementation (1994) (98)
The Expected Linearity of a Simple Equivalence Algorithm (1978) (93)
A Lower Bound for the Length of Addition Chains (1975) (86)
Fehlerfortpflanzung bei Interpolation (1961) (67)
Fast reduction and composition of binary quadratic forms (1991) (60)
Zur Konvergenz des Jacobi-Verfahrens (1961) (43)
Zur quadratischen Konvergenz des Jacobi-Verfahrens (1964) (33)
Zur rationalen approximierbarkeit von e−xüber [0, ∞) (1973) (30)
Polynomial root separation examples (2006) (27)
Variations on computing reciprocals of power series (2000) (26)
Geometric convergence toe−z by rational functions with real poles (1975) (24)
Über das Wachstum zusammengesetzter Funktionen (1960) (24)
Equation Solving in Terms of Computational Complexity (2010) (23)
Probabilistic Computation of Integer Polynomial GCDs (1988) (19)
Unitäre Transformationen großer Matrizen (1972) (18)
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic (1993) (17)
Multiplikation großer Zahlen (1966) (16)
Eine Bemerkung zur Konstruktion großer Primzahllücken (1963) (16)
Geometric convergence to e−z by rational functions with real poles (1975) (15)
A nonlinear lower bound for random-access machines under logarithmic cost (1988) (14)
A New Approach to Resultant Computations and Other Algorithms with Exact Division (1994) (14)
An Elementary Proof for Strassen's Degree Bound (1976) (10)
Optimale Punkte für Differentiation und Integration (1963) (9)
Zur Quadratur holomorpher periodischer Funktionen (1975) (9)
Zur Konvergenz der Stufenpolynome über den Nullstellen der Legendre-Polynome (1972) (9)
Bivariate Polynomial Multiplication Patterns (1995) (7)
Lebesguekonstanten bei numerischer Differentiation (1966) (7)
Rational Approximation to $e^{ - x} $ and Related $\mathcal{L}^2 $-Problems (1982) (7)
Adaptive Raising Strategies Optimizing Relative Efficiency (2003) (5)
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method (1998) (5)
Mehrdimensionale Romberg-Integration (1970) (5)
Zum Schubfächerprinzip im linearen Intervall (1957) (5)
Mehrdimensionale Romberg-Integration (1970) (5)
Über ein zahlentheoretisches Problem aus der Fourieranalysis (1971) (4)
Arbitrary perturbations of hermitian matrices (1979) (4)
The production of partial orders (2019) (3)
Zur Ränderzuordnung beim Riemannschen Abbildungssatz (1969) (1)
Die Diskriminante einer Matrix (1977) (1)
4 Fourier-Approximation (1971) (0)
6 Tschebyscheff-Approximation (1971) (0)
8 Quantitative Fragen der Approximierbarkeit (1971) (0)
2 Approximierbarkeit in speziellen Räumen (1971) (0)
3 Orthogonale Polynome (1971) (0)
Optimal Quadrature Formulae for Periodic Functions (1974) (0)
7 L1-Approximation (1971) (0)
1 Approximation in linearen normierten Räumen (1971) (0)
Vier Neuentwicklungen auf dem Gebiet der elektronischen Rechenautomaten (1958) (0)
Verzeichnis der verwendeten Symbole (1971) (0)
Namen- und Sachverzeichnis (1971) (0)
Geometric Convergence to e to the minus Z Power Functions with Real Poles. (1975) (0)

This paper list is powered by the following services:

Other Resources About Arnold Schönhage

en.wikipedia.org

What Schools Are Affiliated With Arnold Schönhage?

Arnold Schönhage is affiliated with the following schools:

Arnold Schönhage's Academic­Influence.com Rankings