On the message complexity of binary Byzantine agreement under crash failures
type: Item
instance of: scholarly article
title: On the message complexity of binary Byzantine agreement under crash failures
zbMATH Open document ID: 0744.68032
DOI: 10.1007/BF02277665
author: Eugene S. Amdur
author: Samuel M. Weber
author: Vassos Hadzilacos
published in: Distributed Computing
publication date: 1992-09-27T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 58221
zbMATH Keywords: fault-tolerance
zbMATH Keywords: agreement
zbMATH Keywords: distributed system
zbMATH Keywords: protocols
MaRDI profile type: Publication
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: Bounds on information exchange for Byzantine agreement
cites work: Authenticated Algorithms for Byzantine Agreement
cites work: Knowledge and common knowledge in a Byzantine environment: Crash failures
cites work: Q4734747
cites work: Q3666268
cites work: A lower bound for the time to assure interactive consistency
cites work: Message-optimal protocols for Byzantine Agreement
cites work: Reaching Agreement in the Presence of Faults
description: scientific article; zbMATH DE number 58221