Arnold Schönhage

发表

Arnold Schönhage, A. Schönhage, 2006, J. Symb. Comput..

Arnold Schönhage, 1980, SIAM J. Comput..

Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic

Arnold Schönhage, A. Schönhage, 1993, ICALP.

Probabilistic Computation of Integer Polynomial GCDs

Arnold Schönhage, 1988, J. Algorithms.

Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method

Arnold Schönhage, 1998, FOCS.

Fast reduction and composition of binary quadratic forms

Arnold Schönhage, A. Schönhage, 1991, ISSAC '91.

Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients

Arnold Schönhage, A. Schönhage, 1982, EUROCAM.

Schnelle Multiplikation großer Zahlen

Arnold Schönhage, Volker Strassen, Arnold Schönhage, 1971, Computing.

Quasi-GCD computations

Arnold Schönhage, A. Schönhage, 1985, J. Complex..

Adaptive Raising Strategies Optimizing Relative Efficiency

Arnold Schönhage, A. Schönhage, 2003, ICALP.

Schnelle Berechnung von Kettenbruchentwicklungen

Arnold Schönhage, Arnold Schönhage, 1971, Acta Informatica.

Partial and Total Matrix Multiplication

Arnold Schönhage, A. Schönhage, 1981, SIAM J. Comput..

A New Approach to Resultant Computations and Other Algorithms with Exact Division

Arnold Schönhage, Ekkehart Vetter, A. Schönhage, 1994, ESA.

Variations on computing reciprocals of power series

Arnold Schönhage, 2000, Inf. Process. Lett..

Fast algorithms - a multitape Turing machine implementation

Arnold Schönhage, Ekkehart Vetter, Andreas F. Grotefeld, 1994 .

Storage Modification Machines

Arnold Schönhage, 1979, Theoretical Computer Science.

An Elementary Proof for Strassen's Degree Bound

Arnold Schönhage, 1976, Theor. Comput. Sci..

Bivariate Polynomial Multiplication Patterns

Arnold Schönhage, 1995, AAECC.

Multiplikation großer Zahlen

Arnold Schönhage, 2005, Computing.

Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2

Arnold Schönhage, Arnold Schönhage, 1977, Acta Informatica.

On the Power of Random Access Machines

Arnold Schönhage, A. Schönhage, 1979, ICALP.

Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm

Arnold Schönhage, 1984, ICALP.

A nonlinear lower bound for random-access machines under logarithmic cost

Arnold Schönhage, 1988, JACM.

The fundamental theorem of algebra in terms of computational complexity - preliminary report

Arnold Schönhage, A. Schönhage, 1982 .

A Lower Bound for the Length of Addition Chains

Arnold Schönhage, 1975, Theor. Comput. Sci..

Finding the Median

Arnold Schönhage, Mike Paterson, Nicholas Pippenger, 1976, J. Comput. Syst. Sci..

Fast algorithms for multiple evaluations of the riemann zeta function

Arnold Schönhage, Andrew M. Odlyzko, 1988 .

Arbitrary perturbations of hermitian matrices

Arnold Schönhage, 1979 .