Fast, robust, quantizable approximate consensus

DOI10.4230/LIPICS.ICALP.2016.137zbMATH Open1388.68293OpenAlexW2544146117MaRDI QIDQ4598280FDOQ4598280

Authors: Bernadette Charron-Bost, Matthias Függer, Thomas Nowak 

Publication date: 19 December 2017

Full work available at URL: https://hal.science/hal-01395576

Recommendations

• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Fast multidimensional asymptotic and approximate consensus
• Quantized consensus
• Tight Bounds for Asymptotic and Approximate Consensus
• Tight bounds for asymptotic and approximate consensus

zbMATH Keywords

dynamic networksaveraging algorithmsapproximate consensus

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (7)

• A topological perspective on distributed network algorithms
• Fast Multidimensional Asymptotic and Approximate Consensus
• Tight Bounds for Asymptotic and Approximate Consensus
• Fast Algorithms for Geometric Consensuses
• Resilient Randomized Quantized Consensus
• Fast plurality consensus in regular expanders
• Robust Distributed Consensus Using Total Variation

This page was built for publication: Fast, robust, quantizable approximate consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598280)