Some upper and lower bounds on the coupon collector problem

Journal of Computational and Applied Mathematics

Volumn 200, Issue 1, 2007, Pages 154-167

  Shioda, S ^a  

^a CHIBA UNIVERSITY   (Japan)

Author keywords

Bounds; Coupon collector problem; Denial of service attack; Distribution function; IP traceback

Indexed keywords

COMPUTATION THEORY; FUNCTION EVALUATION; INTERNET; NETWORK PROTOCOLS; NUMERICAL METHODS; PROBABILISTIC LOGICS;

BOUNDS; COUPON COLLECTOR PROBLEM; DISTRIBUTION FUNCTION; IP TRACEBACK; SERVICE ATTACKS;

PROBLEM SOLVING;

EID: 33750964153     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2005.12.011     Document Type: Article

References (8)

1. Boneh S., and Papanicolaou V. General asymptotics estimates for the coupon collector problem. J. Comput. Appl. Math. 67 (1996) 277-289
2. W. Feller, An Introduction to Probability Theory and Its Applications, second ed., vol. 1, Wiley, New York, 1966.
3. Flajolet P., Gardy D., and Thimonier L. Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl. Math. 39 (1992) 207-229
4. Holst L. Extreme value distributions for random coupon collector and birthday problems. Extremes 4 2 (2001) 129-145
5. Marshall A., and Olkin I. Inequalities: Theore of Majorization and its Applications (1979), Academic Press, New York
6. Martinez S. Some bounds on the coupon collector problem. Random Struct. Algorithms 25 (2004) 208-226
7. Papanicolaou V., Kokolakis G., and Boneh S. Asymptotics for the random coupon collector problem. J. Comput. Appl. Math. 93 (1998) 95-105
8. Savage A., Wetherall D., Karlin A., and Anderson T. Network support for IP traceback. IEEE/ACM Trans. Networking 9 3 (2001) 226-237