A weakest failure detector-based asynchronous consensus protocol for f
From MaRDI portal
Publication:2390214
Recommendations
- The weakest failure detector for solving consensus
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- The weakest failure detector for solving consensus
- Early consensus in an asynchronous system with a weak failure detector
- scientific article; zbMATH DE number 2013834
Cites work
Cited in
(17)- Communication-efficient failure detection and consensus in omission environments
- The weakest failure detector to implement a register in asynchronous systems with hybrid communication
- Open consensus
- The weakest failure detector for solving consensus
- On implementing omega with weak reliability and synchrony assumptions
- Fair Exchange Is Incomparable to Consensus
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- Early consensus in an asynchronous system with a weak failure detector
- Failure detection and consensus in the crash-recovery model
- The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
- The overhead of consensus failure recovery
- A simple and fast asynchronous consensus protocol based on a weak failure detector
- scientific article; zbMATH DE number 2013834 (Why is no real title available?)
- The weakest failure detector to solve nonuniform consensus
- The weakest failure detector to solve nonuniform consensus
- The weakest failure detector for solving consensus
- From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors
This page was built for publication: A weakest failure detector-based asynchronous consensus protocol for \(f<n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390214)