Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
A Layered Analysis of Consensus
SIAM Journal on Computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Reasoning About Knowledge
Asynchronous Agreement and Its Relation with Error-Correcting Codes
IEEE Transactions on Computers
No Double Discount: Condition-Based Simultaneity Yields Limited Gain
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Revisiting simultaneous consensus with crash failures
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
We consider the consensus problem in synchronous message-passing distributed systems. A celebrated result states that every protocol that is guaranteed to tolerate up to t crash failures has a worst-case execution in which some process does not decide before the end of t+1 rounds. A variant of the problem in which the set of input vectors is restricted is called condition-based consensus. In this setting, Mostefaoui, Rajsbaum and Raynal defined a natural degree of restriction called the condition of the set of input vectors that a protocol is assumed to handle. The condition is a natural number d=