ICALP
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
The list update problem is a classical online problem, with an optimal competi
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...