Sciweavers

RANDOM
1998
Springer
14 years 3 months ago
"Balls into Bins" - A Simple and Tight Analysis
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...
Martin Raab, Angelika Steger
RANDOM
1998
Springer
14 years 3 months ago
Disjoint Paths in Expander Graphs via Random Walks: A Short Survey
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
Alan M. Frieze
RANDOM
1998
Springer
14 years 3 months ago
Randomized Lower Bounds for Online Path Coloring
Stefano Leonardi, Andrea Vitaletti
RANDOM
1998
Springer
14 years 3 months ago
On Balls and Bins with Deletions
Richard Cole, Alan M. Frieze, Bruce M. Maggs, Mich...
RANDOM
1998
Springer
14 years 3 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
RANDOM
1998
Springer
14 years 3 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...
RANDOM
1998
Springer
14 years 3 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
RANDOM
1998
Springer
14 years 3 months ago
The "Burnside Process" Converges Slowly
Leslie Ann Goldberg, Mark Jerrum