New deterministic CA protocols achieve near-optimal communication for finite convexity spaces and R^d using extractor-based committee assignment.
Efficient adaptively-secure byzantine agreement for long messages
1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.
1
Pith paper citing it
10
external citations · OpenAlex
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.