Tight Bounds for Asymptotic and Approximate Consensus

DOI10.1145/3212734.3212762zbMath1428.68067arXiv1705.02898OpenAlexW2810645111MaRDI QIDQ5197697

Manfred Schwarz, Matthias Függer, Thomas Nowak

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.02898

zbMATH Keywords

lower boundsdynamic networksasymptotic consensusapproximate consensus

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Wait-free approximate agreement on graphs ⋮ A topological perspective on distributed network algorithms ⋮ Fast Multidimensional Asymptotic and Approximate Consensus

This page was built for publication: Tight Bounds for Asymptotic and Approximate Consensus