Faster randomized consensus with an oblivious adversary
From MaRDI portal
Publication:5918243
DOI10.1007/s00446-013-0195-yzbMath1322.68254OpenAlexW2011106535MaRDI QIDQ5918243
Publication date: 25 March 2015
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-013-0195-y
Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Tight bounds for adopt-commit objects
- Combining shared-coin algorithms
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- Round-by-round fault detectors (extended abstract)
- On the time and space complexity of randomized test-and-set
- Polylog randomized wait-free consensus
- Sub-logarithmic Test-and-Set against a Weak Adversary
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
- Tight bounds for asynchronous randomized consensus
- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
- Impossibility of distributed consensus with one faulty process
- Efficient asynchronous consensus with the weak adversary scheduler
- Lower Bounds for Randomized Consensus under a Weak Adversary
- Polylogarithmic concurrent data structures from monotone circuits
- Linearizable implementations do not suffice for randomized distributed computation
- Faster randomized consensus with an oblivious adversary
This page was built for publication: Faster randomized consensus with an oblivious adversary
