Stopping times of distributed consensus protocols: a probabilistic analysis

DOI10.1016/0020-0190(87)90127-XzbMath0619.68015OpenAlexW2151815767WikidataQ59491574 ScholiaQ59491574MaRDI QIDQ1089784

Ozalp Babaoglu

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90127-x

zbMATH Keywords

distributed computing systemresiliencyByzantine agreementprocessorsreliable computingprobabilistic failuresystem executions

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Authenticated Algorithms for Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem

This page was built for publication: Stopping times of distributed consensus protocols: a probabilistic analysis