Fast consensus in networks of bounded degree.
type: Item
instance of: scholarly article
title: Fast consensus in networks of bounded degree.
zbMATH Open document ID: 1282.68092
DOI: 10.1007/BF02280836
author: Piotr Berman
author: Juan Garay
published in: Distributed Computing
publication date: 1995-11-22T00:00:00Z
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 493615
MaRDI profile type: Publication
cites work: Atomic broadcast: From simple message diffusion to Byzantine agreement
cites work: Modular construction of a Byzantine agreement protocol with optimal message bit complexity
cites work: The Byzantine generals strike again
cites work: Fault Tolerance in Networks of Bounded Degree
cites work: Bounds on information exchange for Byzantine agreement
cites work: Reaching Agreement in the Presence of Faults
cites work: Q3326832
cites work: Tolerating linear number of faults in networks of bounded degree
Recommended article: Fast Convergence for Consensus in Dynamic Networks
Recommended article: Fast convergence for consensus in dynamic networks
Recommended article: Fast agreement in networks with Byzantine nodes
Recommended article: Fast consensus seeking on networks with antagonistic interactions
Recommended article: On fast-slow consensus networks with a dynamic weight
Recommended article: Fast deterministic consensus in a noisy environment
Recommended article: Convergence speed in distributed consensus over dynamically switching random networks
Recommended article: Consensus Over Numerosity-Constrained Random Networks
Recommended article: Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
Recommended article: Fast byzantine agreement in dynamic networks
description: scientific article; zbMATH DE number 493615