Efficient agreement using fault diagnosis.
type: Item
instance of: scholarly article
title: Efficient agreement using fault diagnosis.
zbMATH Open document ID: 1282.68083
DOI: 10.1007/BF02280838
author: Brian A. Coan
published in: Distributed Computing
publication date: 1995-11-22T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 493613
MaRDI profile type: Publication
cites work: Consensus algorithms with one-bit messages
cites work: Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
cites work: Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
cites work: Modular construction of a Byzantine agreement protocol with optimal message bit complexity
cites work: Modular construction of an efficient 1-bit Byzantine agreement protocol
cites work: The Byzantine generals strike again
cites work: An efficient algorithm for byzantine agreement without authentication
cites work: Bounds on information exchange for Byzantine agreement
cites work: Early stopping in Byzantine agreement
cites work: A lower bound for the time to assure interactive consistency
cites work: Easy impossibility proofs for distributed consensus problems
cites work: Fully polynomial Byzantine agreement in t + 1 rounds
cites work: The Byzantine Generals Problem
cites work: Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
cites work: Reaching Agreement in the Presence of Faults
cites work: A new solution for the Byzantine generals problem
cites work: Fast Distributed Agreement
full work available at URL: https://doi.org/10.1007/bf02280838
OpenAlex ID: W2006856191
description: scientific article; zbMATH DE number 493613