Two Byzantine-tolerant renaming algorithms using a new scalable committee election primitive achieve O(polylog n) time and Õ(n) or Õ(n + min{nf,T}) communication.
The byzantine generals problem.ACM Trans- actions on Programming Languages and Systems, 4(3):382–401, 1982
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed Renaming with Subquadratic Bits via Scalable Committee Election
Two Byzantine-tolerant renaming algorithms using a new scalable committee election primitive achieve O(polylog n) time and Õ(n) or Õ(n + min{nf,T}) communication.