83 search results - page 1 / 17 » Consensus in byzantine asynchronous systems |
OPODIS
1997
13 years 6 months ago
1997
Unreliable fault detectors can be used to solve the consensus problem in asynchronous distributed systems that are subject to crash faults. We extend this result to asynchronous d...
SAC
2010
ACM
13 years 11 months ago
2010
ACM
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...
WDAG
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
SIROCCO
2000
13 years 6 months ago
2000
PODC
1999
ACM
13 years 9 months ago
1999
ACM
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...