Sciweavers

481 search results - page 17 / 97
» Distributed Consensus, revisited
Sort
View
SAC
2010
ACM
15 years 10 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
PODC
2006
ACM
15 years 9 months ago
Timeliness, failure-detectors, and consensus performance
We study the implication that various timeliness and failure detector assumptions have on the performance of consensus algorithms that exploit them. We present a general framework...
Idit Keidar, Alexander Shraer
99
Voted
ACS
2008
15 years 2 months ago
Mal'cev Conditions Revisited
Dominique Bourn, Jirí Rosický
ICS
2010
Tsinghua U.
16 years 1 months ago
Reaching Consensus on Social Networks
Abstract: Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are supposed to achieve a task are unaware o...
Elchanan Mossel, Grant Schoenebeck
122
Voted
CDC
2008
IEEE
129views Control Systems» more  CDC 2008»
15 years 10 months ago
Rate of Convergence for Consensus with Delays
— We study the problem of reaching a consensus in the values of a distributed system of agents with time-varying connectivity in the presence of delays. We consider a widely stud...
Pierre-Alexandre Bliman, Angelia Nedic, Asuman E. ...