Author:
Pekoz Erol,Ross Sheldon M.
Reference6 articles.
1. Blom, G., and Sandell, D. Cover times for random walks on graphs. Math. Scientist
17, 111–119, 1992.
2. Flajolet, Gardy, and Thimonier, “Birthday paradox, coupon collectors, caching algorithms, and self organizing search.” Discrete Appl. Math.
39, 207–229, 1992.
3. Nath, H. B. Waiting time in the coupon collector’s problem. Austral. J. Stat.
15, 132–135, 1973.
4. Palacios, J. L. Cover times for stars. Math. Scientist
18, 103–107, 1994.
5. Ross, S. M. Simulation. Academic Press, Cambridge, 1997.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The coupon subset collection problem;Journal of Applied Probability;2001-09