Sciweavers

13 search results - page 3 / 3
» wdag 2000
Sort
View
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
13 years 9 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
13 years 9 months ago
Distributed Cooperation During the Absence of Communication
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 9 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna