The Double Dixie Cup Problem
From MaRDI portal
Cited in
(38)- Poisson randomization in occupancy problems
- Combinatorial problems of probability theory
- Analysis of random probing hashing
- An approximate analysis of the performance of extendible hashing with elastic buckets
- On coupon collector's and Dixie cup problems under fixed and random sample size sampling schemes
- General asymptotic estimates for the coupon collector problem
- Collecting coupons is faster with friends
- Fast overcomplete dictionary construction with probabilistic guarantees
- A survey of the coupon collector's problem with random sample sizes
- On the asymptotic behaviour of the number of trials necessary to complete a set with random selection
- Improved classical and quantum algorithms for subset-sum
- The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
- A generalized coupon collector problem
- Random subcube intersection graphs. I: Cliques and covering
- Omnibus sequences, coupon collection, and missing word counts
- The siblings of the coupon collector
- Reaching consensus on a connected graph
- Speed and concentration of the covering time for structured coupon collectors
- Maximum of exponential random variables, Hurwitz's zeta function, and the partition function
- Identifiability of complete dictionary learning
- Reconstruction of a Riemannian manifold from noisy intrinsic distances
- The logarithmic Zipf law in a general urn problem
- Computing absorbing times via fluid approximations
- Markov chains, \(\mathcal{R}\)-trivial monoids and representation theory
- Finite representability of integers as 2-sums
- Learning \(k\)-modal distributions via testing
- Antiduality and Möbius monotonicity: generalized coupon collector problem
- The number of K-tons in the coupon collector problem
- New easy to compute formulas for the moments of random variables appearing in the coupon collector problem
- School choice with independent versus consolidated districts
- Dixie cup problem in an interlacing process
- A new linear distinguisher for four-round AES
- Fast simulations of the multi-album collector
- On a generalisation of the coupon collector problem
- Coupon collector problem with penalty coupon
- The geometry of codes for random access in DNA storage
- Games of chance with multiple objectives
- Strategies for parallel unaware cleaners
This page was built for publication: The Double Dixie Cup Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3268605)
