Fast parallel GCD algorithm of many integers

Authors:
Sidi M. Sedjelmaci
Affiliations:
University of Paris-Nord, Villetaneuse, France
Venue:
ACM Communications in Computer Algebra
Year:
2014

Citing 3
Cited 0

Two fast GCD algorithms

Journal of Algorithms
On a parallel Lehmer-Euclid GCD algorithm

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
GCD of many integers (extended abstract)

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new parallel algorithm which computes the GCD of n integers of O(n) bits in O(n / log n) time with O(n2+ε) processors, for any ε 0 on CRCW PRAM model.