Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.
Asymptotically optimal algorithms for approximate agreement.Distributed Computing, 4(1):9–29
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.