Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. R. P. Brent and H. T. Kung. A systolic algorithm for integer GCD computation. In K. Hwang, editor, Procs. of the 7th Symp. on Computer Arithmetic, pages 118–125. IEEE Computer Society, June 1985.
2. B. Chor and O. Goldreich. An improved parallel algorithm for integer GCD. Algorithmica, 5:1–10, 1990.
3. G. E. Collins. The computing time of the Euclidean algorithm. SIAM Journal on Computing, 3:1–10, 1974.
4. T. Jebelean. A Generalization of the Binary GCD Algorithm. In M. Bronstein, editor, ISSAC'93: International Symposium on Symbolic and Algebraic Computation, pages 111–116, Kiev, Ukraine, July 1993. ACM Press.
5. T. Jebelean. An Algorithm for Exact Division. Journal of Symbolic Computation, 15(2):169–180, February 1993.