Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Inoue, Kiyoshi
and
Aki, Sigeo
2007.
On Generating Functions of Waiting Times and Numbers of Occurrences of Compound Patterns in a Sequence of Multistate Trials.
Journal of Applied Probability,
Vol. 44,
Issue. 1,
p.
71.
Luo, Xucheng
Qin, Zhiguang
Geng, Ji
and
Wang, Qiang
2007.
Efficient Multi-source Location in Unstructured P2P Systems.
p.
61.
Mahmoud, Hosam M.
2010.
Gaussian phases in generalized coupon collection.
Advances in Applied Probability,
Vol. 42,
Issue. 4,
p.
994.
Smythe, R. T.
2011.
Generalized Coupon Collection: The Superlinear Case.
Journal of Applied Probability,
Vol. 48,
Issue. 01,
p.
189.
Gadrich, Tamar
and
Ravid, Rachel
2011.
The Sequential Occupancy Problem through Group Throwing of Indistinguishable Balls.
Methodology and Computing in Applied Probability,
Vol. 13,
Issue. 2,
p.
433.
Cunche, M.
Kaafar, M. A.
Jiefeng Chen
Boreli, R.
and
Mahanti, A.
2012.
Why are they hiding? Study of an anonymous file sharing system.
p.
1.
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.
Chakraborty, Abhishek
Mazumdar, Bodhisatwa
and
Mukhopadhyay, Debdeep
2015.
A practical DPA on Grain v1 using LS-SVM.
p.
44.
Mano, Toru
Inoue, Takeru
Ikarashi, Dai
Hamada, Koki
Mizutani, Kimihiro
and
Akashi, Osamu
2016.
Efficient Virtual Network Optimization Across Multiple Domains Without Revealing Private Information.
IEEE Transactions on Network and Service Management,
Vol. 13,
Issue. 3,
p.
477.
Xu, Chuan
Beauquier, Joffroy
Burman, Janna
Kutten, Shay
and
Nowak, Thomas
2020.
Data collection in population protocols with non-uniformly random scheduler.
Theoretical Computer Science,
Vol. 806,
Issue. ,
p.
516.
Falgas-Ravry, Victor
Larsson, Joel
and
Markström, Klas
2020.
Speed and concentration of the covering time for structured coupon collectors.
Advances in Applied Probability,
Vol. 52,
Issue. 2,
p.
433.
Zheng, Lukun
and
Zheng, Huiqiang
2020.
Authorship Attribution via Coupon-Collector-Type Indices.
Journal of Quantitative Linguistics,
Vol. 27,
Issue. 4,
p.
321.
Shioda, Shigeo
2021.
Coupon Subset Collection Problem with Quotas.
Methodology and Computing in Applied Probability,
Vol. 23,
Issue. 4,
p.
1203.
Williams, Jack R.
Baltz, Samuel
and
Stewart, Charles
2024.
Votes Can Be Confidently Bought in Some Ranked Ballot Elections, and What to Do about It.
Political Analysis,
Vol. 32,
Issue. 4,
p.
463.