Improvements on the accelerated integer GCD algorithm

Authors:
Mohamed S. Sedjelmaci;Christian Lavault
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1997

Citing 0
Cited 2

On a parallel Lehmer-Euclid GCD algorithm

Proceedings of the 2001 international symposium on Symbolic and algebraic computation
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

Quantified Score

Hi-index	0.89

Visualization

Abstract