Arnold Schönhage

According to our database1, Arnold Schönhage
  • authored at least 27 papers between 1966 and 2006.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2006
Polynomial root separation examples.
J. Symb. Comput., 2006

2003
Adaptive Raising Strategies Optimizing Relative Efficiency.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2000
Variations on computing reciprocals of power series.
Inf. Process. Lett., 2000

1998
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1995
Bivariate Polynomial Multiplication Patterns.
Proceedings of the Applied Algebra, 1995

1994
A New Approach to Resultant Computations and Other Algorithms with Exact Division.
Proceedings of the Algorithms, 1994

Fast algorithms - a multitape Turing machine implementation.
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.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1991
Fast Reduction and Composition of Binary Quadratic Forms.
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

1988
Probabilistic Computation of Integer Polynomial GCDs.
J. Algorithms, 1988

A nonlinear lower bound for random-access machines under logarithmic cost.
J. ACM, 1988

1985
Quasi-GCD computations.
J. Complexity, 1985

1984
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm.
Proceedings of the Automata, 1984

1982
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients.
Proceedings of the Computer Algebra, 1982

The fundamental theorem of algebra in terms of computational complexity - preliminary report.
Universität Tübingen, 1982

1981
Partial and Total Matrix Multiplication.
SIAM J. Comput., 1981

1980
Storage Modification Machines.
SIAM J. Comput., 1980

1979
Storage Modification Machines.
Proceedings of the Theoretical Computer Science, 1979

On the Power of Random Access Machines.
Proceedings of the Automata, 1979

1978
The Expected Linearity of a Simple Equivalence Algorithm.
Theor. Comput. Sci., 1978

1977
Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2.
Acta Inf., 1977

1976
An Elementary Proof for Strassen's Degree Bound.
Theor. Comput. Sci., 1976

Finding the Median.
J. Comput. Syst. Sci., 1976

1975
A Lower Bound for the Length of Addition Chains.
Theor. Comput. Sci., 1975

1971
Schnelle Multiplikation großer Zahlen.
Computing, 1971

Schnelle Berechnung von Kettenbruchentwicklungen.
Acta Inf., 1971

1966
Multiplikation großer Zahlen.
Computing, 1966


  Loading...