Tight bounds for asynchronous randomized consensus
From MaRDI portal
Publication:3452186
Recommendations
- Tight bounds for asynchronous randomized consensus
- Randomized consensus in expected \(O(n \log n)\) individual work
- Lower bounds for randomized consensus under a weak adversary
- Lower bounds for randomized consensus under a weak adversary
- Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
Cited in
(19)- Randomization and failure detection: a hybrid approach to solve consensus
- Randomized consensus in expected \(O(n \log n)\) individual work
- Sublogarithmic test-and-set against a weak adversary
- scientific article; zbMATH DE number 1950667 (Why is no real title available?)
- On the round complexity of randomized Byzantine agreement
- Distributed Computing
- Lower bounds for randomized consensus under a weak adversary
- Tight bounds for asynchronous randomized consensus
- On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
- Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
- Brief Announcement: Improved Consensus in Quantum Networks
- Tight bounds for adopt-commit objects
- A tight space bound for consensus
- Randomized consensus with regular registers
- Communication-efficient randomized consensus
- Faster randomized consensus with an oblivious adversary
- scientific article; zbMATH DE number 1256649 (Why is no real title available?)
- Suppression of resilient targets via coordinated swarms
- Cutoff bounds for consensus algorithms
This page was built for publication: Tight bounds for asynchronous randomized consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452186)
