On the power of shared object types to implement one-resilient consensus
From MaRDI portal
Publication:5137906
Recommendations
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- The gap in circumventing the impossibility of consensus
- Failure detectors as type boosters
- Determining Consensus Numbers
- Space-efficient asynchronous consensus without shared memory initialization
Cites work
Cited in
(10)- Generic proofs of consensus numbers for abstract data types
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- scientific article; zbMATH DE number 1696685 (Why is no real title available?)
- Objects shared by Byzantine processes
- scientific article; zbMATH DE number 7561269 (Why is no real title available?)
- On the power of breakable objects
- Hundreds of impossibility results for distributed computing
- Failure detectors as type boosters
- The gap in circumventing the impossibility of consensus
- Resilient consensus for infinitely many processes. (Extended abstract)
This page was built for publication: On the power of shared object types to implement one-resilient consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137906)