A straight line program computing the integer greatest common divisor (abstract only)

Authors:
Sidi Mohamed Sedjelmaci
Affiliations:
Université Paris-Nord
Venue:
ACM Communications in Computer Algebra
Year:
2008

Citing 3
Cited 0

A taxonomy of problems with fast parallel algorithms

Information and Control
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

Quantified Score

Hi-index	0.00

Visualization

Abstract