Generating Sorted Lists of Random Numbers

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generating Sorted Lists of Random Numbers

Full text

Pdf (408 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 3 (September 1980) table of contents

Pages: 359 - 364

Year of Publication: 1980

ISSN:0098-3500

Authors

Jon Louis Bentley	Univ. of California, Berkeley, and Bendix Corp., Los Angeles
James B. Saxe

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 59, Citation Count: 3

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/355900.355907 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	BENTLEY, J.L., AND SAXE, J.B. Algorithm. Generating sorted hsts of randoms. Rep. CMU-CS- 79-113, Carnegie-Mellon Univ, Pittsburgh, Pa., Comput. Scl. Dep., March 1979.
	2	DAVID, H.A. Order Stat~sttcs. Wiley, New York, 1970.
	3	FRIEDMAN, J.H. Random event generation with preferred frequency distributions. J. Comput Phys. 7, 2 (April 1971), 201-218
	4	JOHNSON, N.L, AND KOTZ, S Continuous Unwar~ate Dtstr~but~ons--2 Houghton-Mifflin, Boston, Mass., 1970
	5	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	6	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998

CITED BY 3

	Bruce Schmeiser, Random variate generation, Proceedings of the 13th conference on Winter simulation, p.227-242, December 09-11, 1981, Atlanta, Georgia
	Gaston H. Gonnet , J. Ian Munro, A linear probing sort and its analysis(Preliminary Draft), Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.90-95, May 11-13, 1981, Milwaukee, Wisconsin, United States
	Jeffrey Scott Vitter, Faster methods for random sampling, Communications of the ACM, v.27 n.7, p.703-718, July 1984