Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.
Lynch, Shlomit S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
SAC is a decentralized iterative filter-and-refine protocol that achieves (F+1)-robustness in LLM multi-agent systems, suppressing Byzantine influence and improving performance on reasoning benchmarks where prior methods fail.
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.