Generation of random objects

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generation of random objects

Full text

Pdf (928 KB)

Source

Winter Simulation Conference archive
Proceedings of the 24th conference on Winter simulation table of contents

Arlington, Virginia, United States

Pages: 270 - 279

Year of Publication: 1992

ISBN:0-7803-0798-4

Author

Luc Devroye

Sponsors

ASA : American Statistical Association
NIST : National Institue of Standards & Technology
IEEE-CS : Computer Society
IEEE-SMCS : Systems, Man & Cybernetics Society
ACM: Association for Computing Machinery
ORSA : Operations Research Society of America
SIGSIM: ACM Special Interest Group on Simulation and Modeling
TIMS :
IIE : Institute of Industrial Engineers
SCS : Society for Computer Simulation

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	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/167293.167349 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	Alfred V. Aho , John E. Hopcroft , Jeffrey Ullman , J. D. Ullman , J. E. Hopcroft, Data Structures and Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	2	Bondesson, L. 1982. On simulation from infinitely divisible distributions. Advances in App//ed Probability 14: 855-869.
	3	Carnal, H. 1970. Dic konvcxc Hffllc yon n rotationssymmetrisch verteiltcn Punkten. Zeitschrift {iir Wahrscheinlichkeitstheorie und verwandte Gebiete 15: 168-176.
	4	Chambers, J. M., C. L. Mallows and B. W. Stuck. 1976. A method for simulating stable random variables. Journal of the American Statistical Association 71: 340-344.
	5	Chen, H. C. and Y. Asau. 1974. On generating random variates from an empirical distribution. AIIE Transactions 6: 163-166.
	6	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	7	Devroye, L. 1982. On the computer generation of random convex hulls Computers and Mathematics with Applications 8" 1-13.
	8	Devroye, L. 1984. Methods for generating random variates with Polya characteristic functions. Statistics and Probability Letters 2: 257-261.
	9	Devroye, L. 1986. Non-Uniform Random Varlate Generation. Springer-Veflag. New York.
	10	Luc Devroye, A note on the height of binary search trees, Journal of the ACM (JACM), v.33 n.3, p.489-498, July 1986 [doi>10.1145/5925.5930]
	11	L Devroye, Branching processes in the analysis of the heights of trees, Acta Informatica, v.24 n.3, p.277-298, June 1987
	12	Luc Bevroye, An automatic method for generating random variates with a given characteristic function, SIAM Journal on Applied Mathematics, v.46 n.4, p.698-719, August 1986 [doi>10.1137/0146046]
	13	Luc Devroye, Generating sums in constant average time, Proceedings of the 20th conference on Winter simulation, p.425-431, December 12-14, 1988, San Diego, California, United States [doi>10.1145/318123.318228]
	14	Devroye, L. and M. Robson. 1992. On the generation of random binary search trees. Technical Report, School of Computer Science, McGill University, Montreal.
	15	Durrett, R. 1991. Probability: Theory and Examples. Wadsworth and Brooks: Pacific Grove, CA.
	16	Fishman, G. S. and L. R. Moore. 1984. Sampling from a discrete distribution while preserving monotonicity. The American Statistician 38" 219-223.
	17	Fishman, G. S. and L. S. Yarberry. 1990. Generating a sample from a k-cell table with changing probabilities in O(log2k) time. Technical Report UNC/OR/TR-90/10, Department of Operations Research, University of North Carolina, Chapel Hill, NC.
	18	Fox, B. L. 1990. Generating Markov-chain transitions quickly: I. ORSA Journal on Computing 2: 126- 135.
	19	Fox, B. L. 1991. Generating Markov-chain transitions quickly- II. ORSA Journal on Computing 2" 3-11.
	20	Graham, R. 1972. An efficient algorithm for determining the convex hull of a finite planar set. /n/ormarion Processing Letters 1" 132-133.
	21	Voratas Kachitvichyanukul , Bruce W. Schmeiser, Binomial random variate generation, Communications of the ACM, v.31 n.2, p.216-222, Feb. 1988 [doi>10.1145/42372.42381]
	22	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
	23	Kronmal, R. A. and A. V. Peterson. 1979. Programs for generating discrete random integers using Walker's alias method. Department of Biostatistics, University of Washington.
	24	Kronmal, R. A. and A. V. Peterson. 1979. On the alias method for generating random variables from a discrete distribution. The American Statistician 33: 214--218.
	25	Mahmoud, H. and B. Pittel. 1984. On the most probable shape of a search tree grown from a random permutation. SIAM Journal on A/gebraic and Discrete Methods 5: 69-81.
	26	Mahmoud, H. M. 1992. Evolution of Random Search Trees. John Wiley: New York.
	27	Neuts, M. F. and M. E. Pagano. 1981. Generating random variates from a distribution of phase type. Technical Report 73B, Applied Mathematics Institute, University of Delaware, Newark, Delaware.
	28	Peterson, A. V. and R. A. Kronmal. 1983. Analytic comparison of three general-purpose methods for the computer generation of discrete random variables. Applied Statistics 32: 276-286.
	29	Pittel, B. 1984. On growing random binary trees. Journal of Mathematical Analysis and Applications 103: 461-480.
	30	Ileana Popescu , Ion Vaduva, A survey on computer generation of some classes of stochastic processes, Mathematics and Computers in Simulation, v.33 n.3, p.223-241, Nov. 1991 [doi>10.1016/0378-4754(91)90121-I]
	31	Franco P. Preparata , Michael I. Shamos, Computational geometry: an introduction, Springer-Verlag New York, Inc., New York, NY, 1985
	32	R~nyi, A. and R. Sulanke. 1963. 0ber die konvexe H fille von n zuf-allig gew~hlten Punkten. Zeitschrift fiir Wahrscheinlichkeitstheorie und verwandte Gebiete 2: 75-84.
	33	R~nyi, A. and R. Sulanke. 1964. 13bet die konvexe H~lle von n zuf'amg gew~hlten Punkten, Zeitschrift ff~r Wahrscheinlichkeitstheorie und verwandte Gebiete 3: 138-1247.
	34	Robson, J. M. 1979. The height of binary search trees. The Austrah'an Computer Journa/11: 151- 153.
	35	Robson, J. M. 1982. The asymptotic behaviour of the height of binary search trees. Australian Computer Science Communications 88.
	36	Seneta, E. 1981. Non-Negative Matrices and Markov Chains. New York: Springer-Verlag.
	37	E. Stadlober, Ratio of uniforms as a convenient method for sampling from classical discrete distributions, Proceedings of the 21st conference on Winter simulation, p.484-489, December 04-06, 1989, Washington, D.C., United States [doi>10.1145/76738.76801]
	38	Stadlober, E. 1989. Binomial random variate generation: a method based on ratio of uniforms. American Journal of Mathematical and Management Sciences 9: 1-20.
	39	Walker, A. J. 1977. New fast method for generating discrete random numbers with arbitrary frequency distributions. Electronics Letters 10: 127-128.
	40	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]