31 search results - page 1 / 7 » On Balls and Bins with Deletions |
RANDOM
1998
Springer
13 years 9 months ago
1998
Springer
ESA
2003
Springer
13 years 10 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose