Arnold Schönhage - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2006

Polynomial root separation examplesArnold Schönhage. JSC, 41(10):1080-1090, 2006. [doi]

2003

Adaptive Raising Strategies Optimizing Relative EfficiencyArnold Schönhage. icalp 2003: 611-623 [doi]

2000

Variations on computing reciprocals of power seriesArnold Schönhage. ipl, 74(1-2):41-46, 2000. [doi]

1998

Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution MethodArnold Schönhage. focs 1998: 212-217 [doi]

1995

Bivariate Polynomial Multiplication PatternsArnold Schönhage. AAECC 1995: 70-81

1994

A New Approach to Resultant Computations and Other Algorithms with Exact DivisionArnold Schönhage, Ekkehart Vetter. esa 1994: 448-459

1993

Fast Parallel Computation of Characteristic Polynomials by Leverrier s POwer Sum Method Adapted to Fields of Finite CharacteristicArnold Schönhage. icalp 1993: 410-417

1991

Fast Reduction and Composition of Binary Quadratic FormsArnold Schönhage. issac 1991: 128-133 [doi]

1988

Probabilistic Computation of Integer Polynomial GCDsArnold Schönhage. jal, 9(3):365-371, 1988.

A nonlinear lower bound for random-access machines under logarithmic costArnold Schönhage. JACM, 35(3):748-754, 1988. [doi]

1985

Quasi-GCD computationsArnold Schönhage. jc, 1(1):118-137, 1985. [doi]

1984

Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction AlgorithmArnold Schönhage. icalp 1984: 436-447

1982

Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex CoeficientsArnold Schönhage. eurocal 1982: 3-15

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

1981

Partial and Total Matrix MultiplicationArnold Schönhage. SICOMP, 10(3):434-455, 1981.

1980

Storage Modification MachinesArnold Schönhage. SICOMP, 9(3):490-508, 1980.

1979

On the Power of Random Access MachinesArnold Schönhage. icalp 1979: 520-529

Storage Modification MachinesArnold Schönhage. tcs 1979: 36-37

1978

The Expected Linearity of a Simple Equivalence AlgorithmDonald E. Knuth, Arnold Schönhage. TCS, 6:281-315, 1978.

1976

An Elementary Proof for Strassen s Degree BoundArnold Schönhage. TCS, 3(2):267-272, 1976.

Finding the MedianArnold Schönhage, Mike Paterson, Nicholas Pippenger. jcss, 13(2):184-199, 1976.

1971

Schnelle Multiplikation großer ZahlenArnold Schönhage, Volker Strassen. computing, 7(3-4):281-292, 1971. [doi]

1966

Multiplikation großer ZahlenArnold Schönhage. computing, 1(3):182-196, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL