31 search results - page 2 / 7 » On Balls and Bins with Deletions |
COMBINATORICS
2004
13 years 7 months ago
2004
We consider the asymptotic behavior of the following model: balls are sequentially thrown into bins so that the probability that a bin with n balls obtains the next ball is propor...
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
Suppose we sequentially throw m balls into n bins. It is a natural question to ask for the maximum number of balls in any bin. In this paper we shall derive sharp upper and lower b...
BERTINORO
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we present and evaluate uncoordinated on-line algorithms for simultaneous storage and replication load-balancing in DHT-based peer-to-peer systems. We compare our ap...
ECCC
2011
13 years 2 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
RSA
1998
13 years 7 months ago
1998
