The correctness proof of Ben-Or's randomized consensus algorithm

DOI10.1007/s00446-012-0162-zzbMath1256.68159OpenAlexW1967908173MaRDI QIDQ1938380

Sam Toueg, Marcos Kawazoe Aguilera

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/7336

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20)

Related Items (8)

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ The correctness proof of Ben-Or's randomized consensus algorithm ⋮ On the complexity of asynchronous agreement against powerful adversaries ⋮ Unnamed Item ⋮ Randomized protocols for asynchronous consensus ⋮ A reduction theorem for randomized distributed algorithms under weak adversaries ⋮ Unnamed Item ⋮ Communication-efficient randomized consensus

Cites Work

• Unnamed Item
• Unnamed Item
• The correctness proof of Ben-Or's randomized consensus algorithm
• Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
• Fast randomized consensus using shared memory
• Impossibility of distributed consensus with one faulty process
• Lower Bounds for Randomized Consensus under a Weak Adversary
• Linearizable implementations do not suffice for randomized distributed computation

This page was built for publication: The correctness proof of Ben-Or's randomized consensus algorithm