Asymptotics for the random coupon collector problem

Journal of Computational and Applied Mathematics

Volumn 93, Issue 2, 1998, Pages 95-105

  Papanicolaou, Vassilis G ^a   Kokolakis, George E ^b   Boneh, Shahar ^c  

^a WICHITA STATE UNIVERSITY   (United States)

^b NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^c METROPOLITAN STATE UNIVERSITY OF DENVER   (United States)

Author keywords

Laplace integral; Random coupon collector problem

Indexed keywords

ALGORITHMS; INTEGRAL EQUATIONS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; PROBABILITY;

LAPLACE INTEGRAL; PROBABILISTIC ALGORITHMS; RANDOM COUPON COLLECTOR PROBLEM;

RANDOM PROCESSES;

EID: 0039984218     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(98)00058-2     Document Type: Article

References (6)

1. C.M. Bender, S.A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, McGraw-Hill, New York, 1978.
2. S. Boneh, V.G. Papanicolaou, General asymptotic estimates for the coupon collector problem, J. Comput. Appl. Math. 67 (2) (1996) 277-289.
3. W. Feller, An Introduction to Probability Theory and Its Applications, vol. II, Wiley, New York, 1966.
4. P. Flajolet, D. Gardy, L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Appl. Math. 39 (1992) 207-229.
5. M. Karwan, V. Lotfi, J. Telgen, S. Zionts, Redundancy in Mathematical Programming, Springer, Berlin, 1983.
6. A. Torn, A. Zallinskas, Global Optimization, Lecture Notes in Computer Science, No. 350, Springer, New York, 1989.