Omnibus Sequences, Coupon Collection, and Missing Word Counts
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/08/27
-
Indian UGC (journal)
-
Refrences24
-
Citations6
-
Sunil Abraham
-
Greg Brockman
-
Stephanie Sapp
-
Anant P. Godbole
Cite
Abraham, Sunil, et al. “Omnibus Sequences, Coupon Collection, and Missing Word Counts”. Methodology and Computing in Applied Probability, vol. 15, no. 2, 2011, pp. 363-78, https://doi.org/10.1007/s11009-011-9247-6.
Abraham, S., Brockman, G., Sapp, S., & Godbole, A. P. (2011). Omnibus Sequences, Coupon Collection, and Missing Word Counts. Methodology and Computing in Applied Probability, 15(2), 363-378. https://doi.org/10.1007/s11009-011-9247-6
Abraham, Sunil, Greg Brockman, Stephanie Sapp, and Anant P. Godbole. “Omnibus Sequences, Coupon Collection, and Missing Word Counts”. Methodology and Computing in Applied Probability 15, no. 2 (2011): 363-78. https://doi.org/10.1007/s11009-011-9247-6.
Abraham S, Brockman G, Sapp S, Godbole AP. Omnibus Sequences, Coupon Collection, and Missing Word Counts. Methodology and Computing in Applied Probability. 2011;15(2):363-78.
Journal Categories
Science
Mathematics
Science
Mathematics
Probabilities
Mathematical statistics
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Exact distribution of the linear combination ofpGumbel random variables | International Journal of Computer Mathematics |
| 8 | 2008 |
The Generalised Coupon Collector Problem | Journal of Applied Probability |
| 24 | 2008 |
Some bounds on the coupon collector problem | Random Structures & Algorithms |
| 3 | 2004 |
| The Collector?s Brotherhood Problem using the Newman-Shepp symbolic method | Algebra universalis |
| 6 | 2003 |
The coupon-collector's problem revisited | Journal of Applied Probability |
| 17 | 2003 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Limit theorem for the Robin Hood game | Statistics & Probability Letters |
| 2019 | |
| Universal Cycle Packings and Coverings for k-Subsets of an n-Set | Graphs and Combinatorics |
| 2 | 2016 |
| Some results on superpatterns for preferential arrangements | Advances in Applied Mathematics |
| 2016 | |
| Preferential Arrangement Superpatterns | Electronic Notes in Discrete Mathematics | 2016 | ||
| Waiting Time Distribution for the Emergence of Superpatterns | Methodology and Computing in Applied Probability |
| 1 | 2015 |
Citations Analysis
The category
Science: Mathematics 5
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Universal Cycles for Weak Orders and was published in 2013. The most recent citation comes from a 2019 study titled Limit theorem for the Robin Hood game. This article reached its peak citation in 2016, with 3 citations. It has been cited in 6 different journals. Among related journals, the Statistics & Probability Letters cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.