The accelerated integer GCD algorithm
ACM Transactions on Mathematical Software (TOMS)
An analysis of Lehmer's Euclidean GCD algorithm
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Proceedings of the twelfth annual symposium on Computational geometry
Computation of replicable functions on Risa/Asir
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
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
A modular integer GCD algorithm
Journal of Algorithms
Jebelean--Weber's algorithm without spurious factors
Information Processing Letters
ACM Communications in Computer Algebra
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
On the l-ary GCD-algorithm in rings of integers
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Robust HGCD with no backup steps
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Using an RSA accelerator for modular inversion
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Fast parallel GCD algorithm of many integers
ACM Communications in Computer Algebra
A novel fast hybrid GCD computation algorithm
International Journal of Computing Science and Mathematics
Hi-index | 0.00 |