Time and Communication Efficient Consensus for Crash Failures
From MaRDI portal
(Redirected from Publication:3524314)
Recommendations
Cited in
(19)- Communication-efficient and crash-quiescent omega with unknown membership
- Communication-efficient randomized consensus
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Confidential gossip
- Efficient gossip and robust distributed computation
- Communication complexity of consensus in anonymous message passing systems
- Reliable Timeout Based Commit Protocol
- On the Message Complexity of Indulgent Consensus
- Fast scalable deterministic consensus for crash failures
- Early-deciding consensus is expensive
- Timeliness, failure-detectors, and consensus performance
- Doing-it-all with bounded work and communication
- Efficient gossip and robust distributed computation
- Reaching consensus in the presence of contention-related crash failures
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Fast agreement in networks with Byzantine nodes
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- Adaptive timeliness of consensus in presence of crash and timing faults
- Gossiping by processors prone to omission failures
This page was built for publication: Time and Communication Efficient Consensus for Crash Failures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524314)
