Multidimensional greatest common divisor and Lehmer algorithms-Reference-Cited by-同舟云学术

Multidimensional greatest common divisor and Lehmer algorithms

Published:1977-12 Issue:4 Volume:17 Page:465-478
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Waterman M. S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01933456.pdf

Reference10 articles.

1. Lecture Notes in Mathematics;L. Bernstein,1970

2. W. A. Beyer and M. S. Waterman,Ergodic computations with continued fractions and Jacobi's algorithm, Numer. Math. 19 (1972), 195–205. Errata 20 (1973), 430.

3. W. A. Blankenship,A new version of the Euclidean algorithm, Amer. Math. Monthly 70 (1963), 742–745.

4. B. F. Caviness,A Lehmer-type greatest common divisor algorithm for Gaussian integers, A talk presented to the SIAM-SIGNUM meeting, Austin, Texas, October 18, 1972.

5. D. E. Knuth,The Art of Computer Programming, Volume 2 / Seminumerical Algorithms, Addison-Wesley, Massachusetts, California, London, 1969.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two Fast Parallel GCD Algorithms of Many Integers;Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation;2017-07-23

2. Fine and Wilf's theorem for three periods and a generalization of Sturmian words;Theoretical Computer Science;1999-04

3. A new algorithm and refined bounds for extended gcd computation;Lecture Notes in Computer Science;1996

4. The complexity of greatest common divisor computations;Lecture Notes in Computer Science;1994