1993 · 59 citations · 9 references
ComputingComputer ScienceAlgorithmsNumber TheoryScientific ComputingComputational Number TheoryNumber-theoretic AlgorithmsGreatest Common Divisor Algorithms
of the binary algorithm for operation at 'word level" by using a new concept of 'modular conjugates" computes the GCD of multiprecision integers two times faster than Lehmer-Euclid method. Most importantly, however, the new algorithm is suitable for systolic parallelization, in 'least-significant digits jirst" pipelined manner and for aggregation with other systolic algorithms for the arithmetic of multiprecision rational numbers.
9
Computational problems associated with Racah algebra
J. Stein · Journal of Computational Physics · 1967 · 170 citations
Euclid's Algorithm for Large Numbers
D. H. Lehmer · American Mathematical Monthly · 1938 · 117 citations
Robert T. Moenck · 1973 · 87 citations