Constant-Space Localized Byzantine Consensus

DOI10.1007/978-3-540-87779-0_12zbMath1161.68333OpenAlexW1528922913MaRDI QIDQ3540228

Ezra N. Hoch, Danny Dolev

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_12

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Distributed CONGEST Algorithms against Mobile Adversaries

Cites Work

• Unnamed Item
• Unnamed Item
• Broadcasting with locally bounded byzantine faults
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Memory space requirements for self-stabilizing leader election protocols
• Bounds on information exchange for Byzantine agreement
• Fast Distributed Agreement
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Optimal Time–Space Tradeoff for Shared Memory Leader Election
• Broadcast in radio networks tolerating byzantine adversarial behavior

This page was built for publication: Constant-Space Localized Byzantine Consensus