Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Tian, Hongcheng
Bi, Jun
Jiang, Xiaoke
and
Zhang, Wei
2010.
A Probabilistic Marking Scheme for Fast Traceback.
p.
137.
Xu, Weiyu
and
Tang, A. Kevin
2011.
A Generalized Coupon Collector Problem.
Journal of Applied Probability,
Vol. 48,
Issue. 4,
p.
1081.
Vojnovic, Milan
and
Proutiere, Alexandre
2011.
Hop limited flooding over dynamic networks.
p.
685.
Doumas, Aristides V.
and
Papanicolaou, Vassilis G.
2012.
The Coupon Collector's Problem Revisited: Asymptotics of the Variance.
Advances in Applied Probability,
Vol. 44,
Issue. 01,
p.
166.
Doumas, Aristides
and
Papanicolaou, Vassilis
2013.
Asymptotics of the rising moments for the coupon collector's problem.
Electronic Journal of Probability,
Vol. 18,
Issue. none,
Tian, Hongcheng
Bi, Jun
and
Jiang, Xiaoke
2013.
An adaptive probabilistic marking scheme for fast and secure traceback.
Networking Science,
Vol. 2,
Issue. 1-2,
p.
42.
Rovatti, Riccardo
Passerini, Cristiano
and
Mazzini, Gianluca
2013.
Benefits of Cooperation in Multiplayer Coupon Collectors' Games.
International Journal of Adaptive, Resilient and Autonomic Systems,
Vol. 4,
Issue. 4,
p.
1.
Abraham, Sunil
Brockman, Greg
Sapp, Stephanie
and
Godbole, Anant P.
2013.
Omnibus Sequences, Coupon Collection, and Missing Word Counts.
Methodology and Computing in Applied Probability,
Vol. 15,
Issue. 2,
p.
363.
Perozzi, Bryan
McCubbin, Christopher
and
Halbert, J. T.
2014.
Scalable graph clustering with parallel approximate PageRank.
Social Network Analysis and Mining,
Vol. 4,
Issue. 1,
Anceaume, Emmanuelle
Busnel, Yann
and
Sericola, Bruno
2015.
New Results on a Generalized Coupon Collector Problem Using Markov Chains.
Journal of Applied Probability,
Vol. 52,
Issue. 02,
p.
405.
Cai, Xing Shi
and
Luc, Devroye
2017.
A study of large fringe and non-fringe subtrees
in conditional Galton-Watson trees
.
Latin American Journal of Probability and Mathematical Statistics,
Vol. 14,
Issue. 1,
p.
579.
Berger, Daniel S.
Beckmann, Nathan
and
Harchol-Balter, Mor
2018.
Practical Bounds on Optimal Caching with Variable Object Sizes.
Proceedings of the ACM on Measurement and Analysis of Computing Systems,
Vol. 2,
Issue. 2,
p.
1.
Tiwari, Trishita
Starobinski, David
and
Trachtenberg, Ari
2018.
Cyber Security Cryptography and Machine Learning.
Vol. 10879,
Issue. ,
p.
38.
Patel, Hasmukh
and
Jinwala, Devesh C
2018.
LPM: A lightweight authenticated packet marking approach for IP traceback.
Computer Networks,
Vol. 140,
Issue. ,
p.
41.
Doumas, A. V.
and
Papanicolaou, V. G.
2018.
The Siblings of the Coupon Collector.
Theory of Probability & Its Applications,
Vol. 62,
Issue. 3,
p.
444.
Doumas, Aristides V.
and
Papanicolaou, Vassilis G.
2019.
Uniform versus Zipf distribution in a mixing collection process.
Statistics & Probability Letters,
Vol. 155,
Issue. ,
p.
108559.
Lorek, Paweł
2019.
Antiduality and Möbius monotonicity: generalized coupon collector problem.
ESAIM: Probability and Statistics,
Vol. 23,
Issue. ,
p.
739.
Ilienko, Andrii
2019.
Convergence of point processes associated with coupon collector’s and Dixie cup problems.
Electronic Communications in Probability,
Vol. 24,
Issue. none,
Doumas, Aristides V.
and
Papanicolaou, Vassilis G.
2020.
The logarithmic Zipf law in a general urn problem.
ESAIM: Probability and Statistics,
Vol. 24,
Issue. ,
p.
275.
Schilling, Judith
and
Henze, Norbert
2021.
Two poisson limit theorems for the coupon collector’s problem with group drawings.
Journal of Applied Probability,
Vol. 58,
Issue. 4,
p.
966.