Birthday paradox, coupon collectors, caching algorithms and self-organizing search
Discrete Applied Mathematics
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Mellin transforms and asymptotics: finite differences and Rice's integrals
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Mining outliers with faster cutoff update and space utilization
Pattern Recognition Letters
On Flooding in the Presence of Random Faults
Fundamenta Informaticae
Hi-index | 0.00 |
The lifetime of a player is defined to be the time where he gets his b-th hit, where a hit will occur with probability p. We consider the maximum statistics of N independent players. For b≠1 this is significantly more difficult than the known instance b=1. The expected value of the maximum lifetime of N players is given by logQ N+(b−1)logQ logQ N+ smaller order terms, where Q=1/(1−p).