Arnold Schönhage

27 papers A* 5A 1B 1Journal 15Unranked 3
YearRankTypeTitle / Venue / Authors
2006 J jnl
Polynomial root separation examples.
J. Symb. Comput.
Arnold Schönhage
2003 A* conf
Adaptive Raising Strategies Optimizing Relative Efficiency.
ICALP
Arnold Schönhage
2000 J jnl
Variations on computing reciprocals of power series.
Inf. Process. Lett.
Arnold Schönhage
1998 A* conf
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method.
FOCS
Arnold Schönhage
1995 — conf
Bivariate Polynomial Multiplication Patterns.
AAECC
Arnold Schönhage
1994 A conf
A New Approach to Resultant Computations and Other Algorithms with Exact Division.
ESA
Arnold Schönhage, Ekkehart Vetter
1994 — book
Fast algorithms - a multitape Turing machine implementation.
Arnold Schönhage, Andreas F. Grotefeld, Ekkehart Vetter
1993 A* conf
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic.
ICALP
Arnold Schönhage
1991 B conf
Fast Reduction and Composition of Binary Quadratic Forms.
ISSAC
Arnold Schönhage
1988 J jnl
A nonlinear lower bound for random-access machines under logarithmic cost.
J. ACM
Arnold Schönhage
1988 J jnl
Probabilistic Computation of Integer Polynomial GCDs.
J. Algorithms
Arnold Schönhage
1985 J jnl
Quasi-GCD computations.
J. Complex.
Arnold Schönhage
1984 A* conf
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm.
ICALP
Arnold Schönhage
1982 — conf
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients.
EUROCAM
Arnold Schönhage
1982 — book
The fundamental theorem of algebra in terms of computational complexity - preliminary report.
Arnold Schönhage
1981 J jnl
Partial and Total Matrix Multiplication.
SIAM J. Comput.
Arnold Schönhage
1980 J jnl
Storage Modification Machines.
SIAM J. Comput.
Arnold Schönhage
1979 A* conf
On the Power of Random Access Machines.
ICALP
Arnold Schönhage
1979 — conf
Storage Modification Machines.
Theoretical Computer Science
Arnold Schönhage
1978 J jnl
The Expected Linearity of a Simple Equivalence Algorithm.
Theor. Comput. Sci.
Donald E. Knuth, Arnold Schönhage
1977 J jnl
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2.
Acta Informatica
Arnold Schönhage
1976 J jnl
An Elementary Proof for Strassen's Degree Bound.
Theor. Comput. Sci.
Arnold Schönhage
1976 J jnl
Finding the Median.
J. Comput. Syst. Sci.
Arnold Schönhage, Mike Paterson, Nicholas Pippenger
1975 J jnl
A Lower Bound for the Length of Addition Chains.
Theor. Comput. Sci.
Arnold Schönhage
1971 J jnl
Schnelle Berechnung von Kettenbruchentwicklungen.
Acta Informatica
Arnold Schönhage
1971 J jnl
Schnelle Multiplikation großer Zahlen.
Computing
Arnold Schönhage, Volker Strassen
1966 J jnl
Multiplikation großer Zahlen.
Computing
Arnold Schönhage