Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Fast computation of GCDs

- Robert T. Moenck
- Mathematics, Computer Science
- STOC '73
- 30 April 1973

An integer greatest common divisor (GCD) algorithm due to Schönhage is generalized to hold in all euclidean domains which possess a fast multiplication algorithm. It is shown that if two N precision… Expand

Approximate algorithms to derive exact solutions to systems of linear equations

- Robert T. Moenck, J. Carter
- Computer Science
- EUROSAM
- 1 June 1979

On the efficiency of algorithms for polynomial factoring

- Robert T. Moenck
- Mathematics
- 1977

Algorithms for factoring polynomials over finite fields are discussed. A construction is shown which reduces the final step of Berlekamp's algorithm to the problem of finding the roots of a… Expand

Practical fast polynomial multiplication

- Robert T. Moenck
- Mathematics, Computer Science
- SYMSAC '76
- 10 August 1976

The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a… Expand

Another polynomial homomorphism

- Robert T. Moenck
- Mathematics, Computer Science
- Acta Informatica
- 1 June 1976

SummaryThe current proposals for applying the so called “fast” O(N logaN) algorithms to multivariate polynomials is that the univariate methods be applied recursively, much in the way more… Expand

Is a linked list the best storage structure for an algebra system?

- Robert T. Moenck
- Computer Science
- SIGS
- 1 August 1978

Virtually all algebraic manipulation systems are very large programs which can only be run on the largest computers, and even then press the limits of the machines resources [1]. I see this as the… Expand