Constant-Space Localized Byzantine Consensus
From MaRDI portal
Recommendations
- Iterative approximate Byzantine consensus in arbitrary directed graphs
- Signature-free asynchronous binary Byzantine consensus with \(t<n/3\), \(O(n^2)\) messages, and \(O(1)\) expected time
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- Minimal synchrony for Byzantine consensus
Cites work
- Bounds on information exchange for Byzantine agreement
- Broadcast in radio networks tolerating Byzantine adversarial behavior
- Broadcasting with locally bounded byzantine faults
- Fast Distributed Agreement
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- Memory space requirements for self-stabilizing leader election protocols
- Optimal Time–Space Tradeoff for Shared Memory Leader Election
- Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
- Self-stabilization
- The Byzantine Generals Problem
- The Byzantine generals strike again
Cited in
(3)
This page was built for publication: Constant-Space Localized Byzantine Consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540228)