Some bounds on the coupon collector problem

DOI10.1002/RSA.20019zbMath1063.60008OpenAlexW2002547599MaRDI QIDQ3156917

Servet Martínez

Publication date: 12 January 2005

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20019

zbMATH Keywords

ratio limit theoremcoupon collector problemsBirthday problem

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items (3)

Some upper and lower bounds on the coupon collector problem ⋮ Omnibus sequences, coupon collection, and missing word counts ⋮ Coupon subset collection problem with quotas

Cites Work

• The general birthday problem

This page was built for publication: Some bounds on the coupon collector problem