Arnold Schönhage

According to our database, Arnold Schönhage authored at least 26 papers between 1966 and 2006.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2006

Polynomial root separation examples.

Arnold Schönhage

J. Symb. Comput., 2006

2003

Adaptive Raising Strategies Optimizing Relative Efficiency.

Arnold Schönhage

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2000

Variations on computing reciprocals of power series.

Arnold Schönhage

Inf. Process. Lett., 2000

1998

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

Arnold Schönhage

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1995

Bivariate Polynomial Multiplication Patterns.

Arnold Schönhage

Proceedings of the Applied Algebra, 1995

1994

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

Arnold Schönhage, Ekkehart Vetter

Proceedings of the Algorithms, 1994

Fast algorithms - a multitape Turing machine implementation.

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

BI-Wissenschaftsverlag, ISBN: 3-41116-891-9, 1994

1993

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

Arnold Schönhage

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1991

Fast Reduction and Composition of Binary Quadratic Forms.

Arnold Schönhage

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1988

Probabilistic Computation of Integer Polynomial GCDs.

Arnold Schönhage

J. Algorithms, 1988

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

Arnold Schönhage

J. ACM, 1988

1985

Quasi-GCD computations.

Arnold Schönhage

J. Complex., 1985

1984

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

Arnold Schönhage

Proceedings of the Automata, 1984

1982

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

Arnold Schönhage

Proceedings of the Computer Algebra, 1982

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

Arnold Schönhage

Universität Tübingen, 1982

1981

Partial and Total Matrix Multiplication.

Arnold Schönhage

SIAM J. Comput., 1981

1980

Storage Modification Machines.

Arnold Schönhage

SIAM J. Comput., 1980

1979

On the Power of Random Access Machines.

Arnold Schönhage

Proceedings of the Automata, 1979

1978

The Expected Linearity of a Simple Equivalence Algorithm.

Donald E. Knuth, Arnold Schönhage

Theor. Comput. Sci., 1978

1977

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

Arnold Schönhage

Acta Informatica, 1977

1976

An Elementary Proof for Strassen's Degree Bound.

Arnold Schönhage

Theor. Comput. Sci., 1976

Finding the Median.

Arnold Schönhage, Mike Paterson, Nicholas Pippenger

J. Comput. Syst. Sci., 1976

1975

A Lower Bound for the Length of Addition Chains.

Arnold Schönhage

Theor. Comput. Sci., 1975

1971

Schnelle Multiplikation großer Zahlen.

Arnold Schönhage, Volker Strassen

Computing, 1971

Schnelle Berechnung von Kettenbruchentwicklungen.

Arnold Schönhage

Acta Informatica, 1971

1966

Multiplikation großer Zahlen.

Arnold Schönhage

Computing, 1966