Tight bounds for asynchronous randomized consensus
From MaRDI portal
Publication:3452186
DOI10.1145/1411509.1411510zbMATH Open1325.68031OpenAlexW2034229945MaRDI QIDQ3452186FDOQ3452186
Authors: Hagit Attiya, Keren Censor-Hillel 
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7497
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
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Distributed algorithms (68W15) Distributed systems (68M14) Network protocols (68M12)
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
- Title not available (Why is that?)
- Distributed Computing
- Lower bounds for randomized consensus under a weak adversary
- On the round complexity of randomized Byzantine agreement
- On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
- Tight bounds for asynchronous randomized consensus
- Brief Announcement: Improved Consensus in Quantum Networks
- Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
- A tight space bound for consensus
- Tight bounds for adopt-commit objects
- Randomized consensus with regular registers
- Communication-efficient randomized consensus
- Faster randomized consensus with an oblivious adversary
- Title not available (Why is that?)
- 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)
