Some bounds on the coupon collector problem
From MaRDI portal
Publication:3156917
DOI10.1002/rsa.20019zbMath1063.60008MaRDI QIDQ3156917
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
Related Items
Omnibus sequences, coupon collection, and missing word counts, Some upper and lower bounds on the coupon collector problem, Coupon subset collection problem with quotas
Cites Work