Algorithm 356: a prime number generator using the treesort principle [A1]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Algorithm 356: a prime number generator using the treesort principle [A1]

Full text

Pdf (674 KB)

Source

Communications of the ACM archive
Volume 12 , Issue 10 (October 1969) table of contents

Page: 563

Year of Publication: 1969

ISSN:0001-0782

Author

Richard C. Singleton

Stanford Research Institute, Menlo Park, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 22, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363235.363244 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	B. A. Charters, Algorithm 311: Prime number generator 2, Communications of the ACM, v.10 n.9, p.570, Sept. 1967 [doi>10.1145/363566.363692]
	2	Richard C. Singleton, Algorithm 357: an efficient prime number generator [A1], Communications of the ACM, v.12 n.10, p.563-564, Oct. 1969 [doi>10.1145/363235.363247]
	3	WILLIAMS, J. W. J. Algorithm 232: Heapsort. Comm. ACM 7 (June 1964), 347;

CITED BY 2

	Richard C. Singleton, Algorithm 357: an efficient prime number generator [A1], Communications of the ACM, v.12 n.10, p.563-564, Oct. 1969
	Harry G. Mairson, Some new upper bounds on the generation of prime numbers, Communications of the ACM, v.20 n.9, p.664-669, Sept. 1977