ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithm 139: Solutions of the diophantine equation
Full text PdfPdf (808 KB)
Source
Communications of the ACM archive
Volume 5 ,  Issue 11  (November 1962) table of contents
Page: 556  
Year of Publication: 1962
ISSN:0001-0782
Author
J. E. L. Peck  Univ. of Alberta, Calgary, Alb., Canada
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 14,   Citation Count: 1
Additional Information:

cited by   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/368996.369014
What is a DOI?

CITED BY
Gordon H. Bradley, Algorithm and bound for the greatest common divisor of n integers, Communications of the ACM, v.13 n.7, p.433-436, July 1970
Collaborative Colleagues:
J. E. L. Peck: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player