Publisher
Springer International Publishing
Reference6 articles.
1. D.E. Knuth, The Art of Computer Programming, Volume 2, Seminumerical Algorithms, 2nd edn. (Addison-Wesley, Boston, 1981)
2. D.H. Lehmer, Euclid’s algorithm for large numbers. Am. Math. Mon. 227–233 (1938)
3. T. Jebelean, A generalization of the binary GCD algorithm, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, vol. 93 (1993), pp. 111–116
4. J. Sorenson, Two fast GCD algorithms. J. Algorithms 16, 110–144 (1994)
5. S.M. Sedjelmaci, Jebelean-Weber’s algorithm without spurious factors. Inf. Process. Lett. 102, 247–252 (2007)