Improvements on the accelerated integer GCD algorithm

Information Processing Letters

Volumn 61, Issue 1, 1997, Pages 31-36

  Sedjelmaci, Mohamed S ^a   Lavault, Christian ^b  

^a UNIVERSITY OF ORAN   (Algeria)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

Integer greatest common divisor (GCD); Number theory; Parallel algorithms; Parallel arithmetic computing

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; NUMBER THEORY; PARALLEL PROCESSING SYSTEMS;

INTEGER GREATEST COMMON DIVISOR (GCD) ALGORITHM; RESIDUAL ALGORITHM; WORST CASE COMPLEXITY;

PARALLEL ALGORITHMS;

EID: 0030825537     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(96)00185-8     Document Type: Article

References (7)

1. R.T. Gregory and E.V. Krishnamurthy, Methods and Applications of Error-Free Computation (Springer, New York, 1984).
2. T. Jebelean, A generalization of the binary GCD algorithm, in: Proc. Internat. Symp. on Symbolic and Algebraic Computation (ISSAC'93) (1993) 111-116.
3. D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Vol. 2 (Addison Wesley, Reading, MA, 2nd ed., 1981).
4. G. Lamé, Note sur la limite des diviseurs dans la recherche du plus grand commun diviseur entre deux nombres entiers, C.R. Acad. Sci. Paris 19 (1844) 867-870.
5. J. Sorenson, Two fast GCD algorithms, J. Algorithms 16 (1994) 110-144.
6. K. Weber, The accelerated integer GCD algorithm, Dept. of Mathematics and Computer Science, Kent State University, 1995.
7. K. Weber, Parallel implementation of the accelerated integer GCD algorithm, J. Symbolic Comput. (Special Issue on Parallel Symbolic Computation) (1996), to appear.