ACM Home Page
Please provide us with feedback. Feedback
Algorithm 237: Greatest common divisor
Full text PdfPdf (650 KB)
Source
Communications of the ACM archive
Volume 7 ,  Issue 8  (August 1964) table of contents
Page: 481  
Year of Publication: 1964
ISSN:0001-0782
Author
J. E. L. Peck  Univ. of Alberta, Calgary, Alberta, Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355586.364802
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
GAUTSCHI, W. Reeursive computation of special functions. U. Mich. Engineering Summer Conferences, Numerical Analysis, 1963.
2
 
1
BLANKINSHIP, W. A. A new version of the Euclidean algorithm. Amer. Math. Mon. 70 (1963), 742-745.