New deterministic CA protocols achieve near-optimal communication for finite convexity spaces and R^d using extractor-based committee assignment.
Brief Announce- ment: From Few to Many Faults: Adaptive Byzantine Agreement with Optimal Communica- tion
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
General Convex Agreement with Near-Optimal Communication
New deterministic CA protocols achieve near-optimal communication for finite convexity spaces and R^d using extractor-based committee assignment.