Good pedagogical random number generators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Good pedagogical random number generators

Full text

Pdf (378 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the twenty-third SIGCSE technical symposium on Computer science education table of contents

Kansas City, Missouri, United States

Pages: 142 - 146

Year of Publication: 1992

ISBN:0-89791-468-6

Also published in ...

Author

J. S. Warford

Department of Computer Science, Pepperdine University, Malibu, CA

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 12, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues peer to peer

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/134510.134539 What is a DOI?

ABSTRACT

A CACM by Park and Miller [6] advocated a standard for random number generators based on the Lehmer generator [5] and criticised a number of computer science textbooks for presenting bad random number generators. This paper advocates the proposed standard and presents a set of generators based on theoretically sound principles that are also useful for microcomputer implementation and classroom presentations at the introductory level.

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	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989 [doi>10.1145/65971.315983]
	2	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989 [doi>10.1145/65971.315983]
	3	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	4	P. L'Ecuyer, Efficient and portable combined random number generators, Communications of the ACM, v.31 n.6, p.742-751, June 1988 [doi>10.1145/62959.62969]
	5	Lehmer, D.H. Mathematical methods in large-scale computing units. Annu. Comput. Lab. Harvard Univ. 26 (1951), 1.41-146.
	6	S. K. Park , K. W. Miller, Random number generators: good ones are hard to find, Communications of the ACM, v.31 n.10, p.1192-1201, Oct. 1988 [doi>10.1145/63039.63042]
	7	Park, S.K., and Miller, Technical Correspondence. Commun. A CM 32, 8 (Aug. 1989), 1023-1024.
	8	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.32 n.8, p.1014-1024, Aug. 1989 [doi>10.1145/65971.315983]
	9	J. Stanley Warford, Computer science, D. C. Heath and Company, Lexington, MA, 1991