Consensus algorithms with one-bit messages
From MaRDI portal
Publication:757011
DOI10.1007/BF01798957zbMath0723.68012MaRDI QIDQ757011
Publication date: 1991
Published in: Distributed Computing (Search for Journal in Brave)
68M10: Network design and communication in computer systems
Related Items
Reconciling fault-tolerant distributed computing and systems-on-chip, Modular construction of a Byzantine agreement protocol with optimal message bit complexity, Efficient agreement using fault diagnosis., A flexible formal framework for masking/demasking faults, Byzantine-resistant total ordering algorithms., Modular construction of an efficient 1-bit Byzantine agreement protocol
Cites Work