Methods for Studying Generalized Birthday and Coupon Collection Problems
From MaRDI portal
Publication:3625311
Recommendations
Cites work
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- Combinatorial Methods in Discrete Distributions
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- On the number of overflown urns and excess balls in an allocation model with limited urn capacity
- Solutions of Some Birthday Problems Using Dirichlet Integrals
- The matching, birthday and the strong birthday problem: a contemporary review
Cited in
(11)- Two simulation models of the birthday problem and certain consequences
- Birthday paradox, coupon collectors, caching algorithms and self- organizing search
- On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes
- Coupon collector's problems with statistical applications to rankings
- A Bayesian peek into Feller volume. I
- On Birthday, Collectors', Occupancy and Other Classical Urn Problems
- On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials
- Two Poisson limit theorems for the coupon collector's problem with group drawings
- A unified approach to generating functions based on Bell polynomials
- On discrete distributions generated from drawing balls with bivariate labels
- Birth, death, coincidences and occupancies: solutions and applications of generalized birthday and occupancy problems
This page was built for publication: Methods for Studying Generalized Birthday and Coupon Collection Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3625311)