232
click to vote
WDAG
16 years 10 days ago
2001 Springer 
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
165
click to vote
WDAG
16 years 10 days ago
2001 Springer 
We generalize the notion of slice introduced in our earlier paper [6]. A slice of a distributed computation with respect to a global predicate is the smallest computation that cont...
211
click to vote
WDAG
16 years 10 days ago
2001 Springer 
Self-stabilizing algorithms for constructing a spanning tree of an arbitrary network have been studied for many models of distributed networks including those that communicate via ...
190
click to vote
WDAG
16 years 10 days ago
2001 Springer 
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
|
Algorithms