Sublinear parallel algorithm for computing the greatest common divisor of two integers
SIAM Journal on Computing
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
An algorithm for exact division
Journal of Symbolic Computation
A generalization of the binary GCD algorithm
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Journal of Algorithms
An analysis of Lehmer's Euclidean GCD algorithm
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Parallel implementation of the accelerated integer GCD algorithm
Journal of Symbolic Computation - Special issue on parallel symbolic computation
Improvements on the accelerated integer GCD algorithm
Information Processing Letters
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A modular reduction for GCD computation
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
A modular integer GCD algorithm
Journal of Algorithms
A parallel extended GCD algorithm
Journal of Discrete Algorithms
A straight line program computing the integer greatest common divisor (abstract only)
ACM Communications in Computer Algebra
A modular integer GCD algorithm
Journal of Algorithms
Fast parallel GCD algorithm of many integers
ACM Communications in Computer Algebra
| Hi-index | 0.00 |
A new version of Euclid's GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms since it can be achieved in &Ogr;∈(n/log n) time using at most n1+∈ processors on CRCW PRAM.