The coupon collector’s problem revisited: generalizing the double Dixie cup problem of Newman and Shepp
ESAIM: PS, 20 (2016) 367-399
Published online: 2016-11-23
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The number of K-tons in the coupon collector problem
John C. SaundersJournal of Applied Probability 1 (2023)
https://doi.org/10.1017/jpr.2022.94
(2023)
https://doi.org/10.2139/ssrn.4494465
K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data
Abiodun M. Ikotun, Absalom E. Ezugwu, Laith Abualigah, Belal Abuhaija and Jia HemingInformation Sciences 622 178 (2023)
https://doi.org/10.1016/j.ins.2022.11.139
Covering the Combinatorial Design Space of Multiplex CRISPR/Cas Experiments in Plants
Kirsten Van Huffel, Michiel Stock, Tom Ruttink and Bernard De BaetsFrontiers in Plant Science 13 (2022)
https://doi.org/10.3389/fpls.2022.907095
BioCCP.jl: collecting coupons in combinatorial biotechnology
Kirsten Van Huffel, Michiel Stock, Bernard De Baets and Lenore CowenBioinformatics 38 (4) 1144 (2022)
https://doi.org/10.1093/bioinformatics/btab775
Encoder Blind Combinatorial Compressed Sensing
Michael Murray and Jared TannerIEEE Transactions on Information Theory 68 (12) 8310 (2022)
https://doi.org/10.1109/TIT.2022.3189278
(2021)
https://doi.org/10.1101/2021.07.09.451763
Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries
Enrico Bianchi and Paolo PennaAlgorithms 14 (2) 55 (2021)
https://doi.org/10.3390/a14020055
The logarithmic Zipf law in a general urn problem
Aristides V. Doumas and Vassilis G. PapanicolaouESAIM: Probability and Statistics 24 275 (2020)
https://doi.org/10.1051/ps/2020011
Sampling from a Mixture of Different Groups of Coupons
Aristides V. Doumas and Vassilis G. PapanicolaouActa Mathematica Sinica, English Series 36 (12) 1357 (2020)
https://doi.org/10.1007/s10114-020-9425-y
Uniform versus Zipf distribution in a mixing collection process
Aristides V. Doumas and Vassilis G. PapanicolaouStatistics & Probability Letters 155 108559 (2019)
https://doi.org/10.1016/j.spl.2019.108559
Antiduality and Möbius monotonicity: generalized coupon collector problem
Paweł LorekESAIM: Probability and Statistics 23 739 (2019)
https://doi.org/10.1051/ps/2019004
The Siblings of the Coupon Collector
A. V. Doumas and V. G. PapanicolaouTheory of Probability & Its Applications 62 (3) 444 (2018)
https://doi.org/10.1137/S0040585X97T988733
Computing absorbing times via fluid approximations
Nicolas Gast and Bruno GaujalAdvances in Applied Probability 49 (3) 768 (2017)
https://doi.org/10.1017/apr.2017.21
The siblings of the coupon collector
Aristides V. Doumas, Aristides V. Doumas, Vassilis G. Papanicolaou and Vassilis G. PapanicolaouТеория вероятностей и ее применения 62 (3) 556 (2017)
https://doi.org/10.4213/tvp5129