Wait-free Byzantine consensus.

DOI10.1016/S0020-0190(01)00334-9zbMath1044.68512MaRDI QIDQ1853073

Paul C. Attie

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Distributed computingFault toleranceWait-freedom

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

Tight bounds for shared memory systems accessed by Byzantine processes

Cites Work

• Fault-tolerant wait-free shared objects
• Bounds on the time to reach agreement in the presence of timing uncertainty
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wait-free Byzantine consensus.