The following pages link to The Double Dixie Cup Problem (Q3268605):
Displayed 30 items.
- Random subcube intersection graphs. I: Cliques and covering (Q311574) (← links)
- Omnibus sequences, coupon collection, and missing word counts (Q352894) (← links)
- Games of chance with multiple objectives (Q745535) (← links)
- Strategies for parallel unaware cleaners (Q896136) (← links)
- Poisson randomization in occupancy problems (Q1051976) (← links)
- Combinatorial problems of probability theory (Q1230456) (← links)
- Analysis of random probing hashing (Q1262118) (← links)
- An approximate analysis of the performance of extendible hashing with elastic buckets (Q1313719) (← links)
- On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes (Q1680802) (← links)
- General asymptotic estimates for the coupon collector problem (Q1919429) (← links)
- Collecting coupons is faster with friends (Q2117703) (← links)
- Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175) (← links)
- A survey of the coupon collector's problem with random sample sizes (Q2475271) (← links)
- On the asymptotic behaviour of the number of trials necessary to complete a set with random selection (Q2625428) (← links)
- Improved classical and quantum algorithms for subset-sum (Q2692398) (← links)
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp (Q2954242) (← links)
- A Generalized Coupon Collector Problem (Q3108477) (← links)
- The Siblings of the Coupon Collector (Q4580423) (← links)
- Reaching consensus on a connected graph (Q4684846) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- Maximum of exponential random variables, Hurwitz's zeta function, and the partition function (Q5022612) (← links)
- Identifiability of Complete Dictionary Learning (Q5025788) (← links)
- Reconstruction of a Riemannian Manifold from Noisy Intrinsic Distances (Q5037574) (← links)
- The logarithmic Zipf law in a general urn problem (Q5110222) (← links)
- Computing absorbing times via fluid approximations (Q5233189) (← links)
- Markov chains, ${\mathscr R}$-trivial monoids and representation theory (Q5246508) (← links)
- Finite Representability of Integers as $2$-Sums (Q5383237) (← links)
- (Q5743483) (← links)
- Antiduality and Möbius monotonicity: generalized coupon collector problem (Q5881046) (← links)
- The number of <i>K</i>-tons in the coupon collector problem (Q6116731) (← links)