Certification of algorithm 266 [G5]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Certification of algorithm 266 [G5]

Full text

Pdf (521 KB)

Source

Communications of the ACM archive
Volume 15 , Issue 12 (December 1972) table of contents

Pages: 1072 - 1073

Year of Publication: 1972

ISSN:0001-0782

Author

Walter L. Sullins

Indiana State Univ., Terre Haute

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms

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/361598.361906 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	Kendall, M.G., and Babington-Smith, B. Randomness and random sampling numbers. J. Royal Statist. Soc. 101 (1938), 147-166.
	2	M. C. Pike , I. D. Hill, Algorithm 266: pseudo-random numbers [G5], Communications of the ACM, v.8 n.10, p.605-606, Oct. 1965 [doi>10.1145/365628.365648]
	3	Yule, G. Udny. A test of Tippett's random sampling numbers. J. Royal Statist. Soc. 101 (1938), 167-172.

CITED BY

To-Yat Cheung, Computational Comparison of Eight Methods for the Maximum Network Flow Problem, ACM Transactions on Mathematical Software (TOMS), v.6 n.1, p.1-16, March 1980

INDEX TERMS

Keywords:
pseudo-random numbers, testing random number generators

Adobe Acrobat

QuickTime

Windows Media Player

Real Player