168 search results - page 25 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
110
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
131
click to vote
IOPADS
1997
15 years 3 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
106
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
110
click to vote
PODC
2005
ACM
15 years 7 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
124
click to vote
STACS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...