AICCSA
2001
IEEE
13 years 8 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...