Pages that link to "Item:Q2774451"
From MaRDI portal
The following pages link to The coupon subset collection problem (Q2774451):
Displayed 13 items.
- Omnibus sequences, coupon collection, and missing word counts (Q352894) (← links)
- The sequential occupancy problem through group throwing of indistinguishable balls (Q539526) (← links)
- On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes (Q1680802) (← links)
- Coupon subset collection problem with quotas (Q2065461) (← links)
- On the number of i.i.d. samples required to observe all of the balls in an urn (Q2270187) (← links)
- Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
- A survey of the coupon collector's problem with random sample sizes (Q2475271) (← links)
- Gaussian phases in generalized coupon collection (Q3074491) (← links)
- The Sticker Collector′s Problem (Q4581602) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
- Generalized Coupon Collection: The Superlinear Case (Q5391091) (← links)
- On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials (Q5443702) (← links)