I. Adler, S. Oren, and S. M. Ross, The coupon-collector's problem revisited, Journal of Applied Probability, vol.47, issue.02, pp.513-518, 2003.
DOI : 10.1017/S002190020001946X

A. Boneh and M. Hofri, The coupon-collector problem revisited ??? a survey of engineering problems and computational methods, Communications in Statistics. Stochastic Models, vol.7, issue.1, pp.39-66, 1997.
DOI : 10.2307/1427290

G. Blom, L. Holst, and D. Sandell, Problems and snapshots from the world of probability, 1994.
DOI : 10.1007/978-1-4612-4304-5

B. Dawkins, Siobhan's problem: the coupon collector revisited, Amer. Statist, vol.45, issue.1, pp.76-82, 1991.

D. [. David and . Barton, Combinatorial Chance., Economica, vol.29, issue.115, 1962.
DOI : 10.2307/2551259

W. Feller, An introduction to probability theory and its applications, 1957.

P. Flajolet, L. Danì-ele-gardy, and . Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

D. Foata, G. Han, and B. Lass, Les nombres hyperharmoniques et la fratrie du collectionneur de vignettes, Sém. Lothar. Combin, vol.47, issue.20, p.2, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00321350

P. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

E. Donald and . Knuth, The art of computer programming, 1997.

R. Motwani and P. Raghavan, Randomized algorithms, 1995.

]. N. Pin80 and . Pintacuda, Coupons collectors via the martingales, Boll. Un. Mat. Ital. A, vol.17, issue.51, pp.174-177, 1980.

G. Pólya, Eine Wahrscheinlichkeitsaufgabe in der Kundenwerbung, ZAMM - Zeitschrift f??r Angewandte Mathematik und Mechanik, vol.10, issue.1, pp.96-97, 1930.
DOI : 10.1002/zamm.19300100113

M. Wild, Counting or producing all fixed cardinality transversals. Algorithmica, to appear, 2013.
DOI : 10.1007/s00453-012-9716-5
URL : http://arxiv.org/abs/1106.0141