Generating a sample from a k-cell table with changing probabilities in O(log2k time

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generating a sample from a k-cell table with changing probabilities in O(log2k time

Full text

Pdf (246 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 19 , Issue 2 (June 1993) table of contents

Pages: 257 - 261

Year of Publication: 1993

ISSN:0098-3500

Authors

George S. Fishman	Univ. of North Carolina
L. Stephen Yarberry

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references 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/152613.152621 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	FISHMAN, G. S., AND MOORE, L.R. Sampling from a discrete distribution while preserving monotonicity. Am. Star. Assoc. 38 (1984), 219 223.
	2	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	3	Ross, S., AND SCHECHNER, Z. Simulation uses of the exponential distribution. In Stochastic Programming, F. Archetti, G. Di Pillo and M. Lucertini, Eds. and in Lecture Note tn Contro{ and Information Sciences 76 (1986), 41 52.
	4	Alastair J. Walker, An Efficient Method for Generating Discrete Random Variables with General Distributions, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.253-256, Sept. 1977 [doi>10.1145/355744.355749]
	5	WONt, C. K., AND EASTON, M. C. An efficient method for weighted sampling without replacement. SIAM d. Comput. 9 (1980), 111 113.