109 search results - page 3 / 22 » Faulty Random Geometric Networks |
OPODIS
2007
15 years 1 months ago
2007
83
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
107
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...