Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers

DOI10.1007/978-3-642-24100-0_36zbMath1350.68032OpenAlexW36843754MaRDI QIDQ3095338

James Aspnes

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_36

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (2)

The correctness proof of Ben-Or's randomized consensus algorithm ⋮ Faster randomized consensus with an oblivious adversary

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted sums of certain dependent random variables
• Tight bounds for asynchronous randomized consensus
• Fast randomized consensus using shared memory
• Time-Lapse Snapshots
• Time- and Space-Efficient Randomized Consensus
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• Probability and Computing

This page was built for publication: Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers