| 2006 |
|---|
| 20 | EE | Arnold Schönhage:
Polynomial root separation examples.
J. Symb. Comput. 41(10): 1080-1090 (2006) |
| 2003 |
|---|
| 19 | EE | Arnold Schönhage:
Adaptive Raising Strategies Optimizing Relative Efficiency.
ICALP 2003: 611-623 |
| 2000 |
|---|
| 18 | EE | Arnold Schönhage:
Variations on computing reciprocals of power series.
Inf. Process. Lett. 74(1-2): 41-46 (2000) |
| 1998 |
|---|
| 17 | EE | Arnold Schönhage:
Multiplicative Complexity of Taylor Shifts and a New Twist of the Substitution Method.
FOCS 1998: 212-217 |
| 1995 |
|---|
| 16 | | Arnold Schönhage:
Bivariate Polynomial Multiplication Patterns.
AAECC 1995: 70-81 |
| 1994 |
|---|
| 15 | | Arnold Schönhage,
Ekkehart Vetter:
A New Approach to Resultant Computations and Other Algorithms with Exact Division.
ESA 1994: 448-459 |
| 1993 |
|---|
| 14 | | Arnold Schönhage:
Fast Parallel Computation of Characteristic Polynomials by Leverrier's POwer Sum Method Adapted to Fields of Finite Characteristic.
ICALP 1993: 410-417 |
| 1991 |
|---|
| 13 | EE | Arnold Schönhage:
Fast Reduction and Composition of Binary Quadratic Forms.
ISSAC 1991: 128-133 |
| 1988 |
|---|
| 12 | EE | Arnold Schönhage:
A nonlinear lower bound for random-access machines under logarithmic cost.
J. ACM 35(3): 748-754 (1988) |
| 11 | | Arnold Schönhage:
Probabilistic Computation of Integer Polynomial GCDs.
J. Algorithms 9(3): 365-371 (1988) |
| 1985 |
|---|
| 10 | EE | Arnold Schönhage:
Quasi-GCD computations.
J. Complexity 1(1): 118-137 (1985) |
| 1984 |
|---|
| 9 | | Arnold Schönhage:
Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm.
ICALP 1984: 436-447 |
| 1982 |
|---|
| 8 | | Arnold Schönhage:
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients.
EUROCAM 1982: 3-15 |
| 1981 |
|---|
| 7 | | Arnold Schönhage:
Partial and Total Matrix Multiplication.
SIAM J. Comput. 10(3): 434-455 (1981) |
| 1980 |
|---|
| 6 | | Arnold Schönhage:
Storage Modification Machines.
SIAM J. Comput. 9(3): 490-508 (1980) |
| 1979 |
|---|
| 5 | | Arnold Schönhage:
On the Power of Random Access Machines.
ICALP 1979: 520-529 |
| 4 | | Arnold Schönhage:
Storage Modification Machines.
Theoretical Computer Science 1979: 36-37 |
| 1978 |
|---|
| 3 | | Donald E. Knuth,
Arnold Schönhage:
The Expected Linearity of a Simple Equivalence Algorithm.
Theor. Comput. Sci. 6: 281-315 (1978) |
| 1976 |
|---|
| 2 | | Arnold Schönhage,
Mike Paterson,
Nicholas Pippenger:
Finding the Median.
J. Comput. Syst. Sci. 13(2): 184-199 (1976) |
| 1 | | Arnold Schönhage:
An Elementary Proof for Strassen's Degree Bound.
Theor. Comput. Sci. 3(2): 267-272 (1976) |
