A simple proof of a simple consensus algorithm

DOI10.1016/0020-0190(89)90182-8zbMath0684.68021OpenAlexW2052043436MaRDI QIDQ1825626

Jayadev Misra

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90182-8

zbMATH Keywords

fault toleranceconsensus protocolbyzantine agreement

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99) Algorithms in computer science (68W99)

Related Items (1)

Tight bounds for shared memory systems accessed by Byzantine processes

Uses Software

• UNITY

Cites Work

• Reaching Agreement in the Presence of Faults
• An efficient algorithm for byzantine agreement without authentication
• Unnamed Item

This page was built for publication: A simple proof of a simple consensus algorithm