Multi-valued byzantine broadcast: Thet < ncase

Martin Hirt, Pavel Raykov · 2014 · Lecture notes in computer science · DOI 10.1007/978-3-662-45608-8_24

1 Pith paper cite this work, alongside 22 external citations. Polarity classification is still indexing.

1 Pith paper citing it

22 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.DC · 2026-02-24 · reject · novelty 7.0

New deterministic CA protocols achieve near-optimal communication for finite convexity spaces and R^d using extractor-based committee assignment.

Showing 1 of 1 citing paper.

General Convex Agreement with Near-Optimal Communication cs.DC · 2026-02-24 · reject · none · ref 40
New deterministic CA protocols achieve near-optimal communication for finite convexity spaces and R^d using extractor-based committee assignment.