Fast Multidimensional Asymptotic and Approximate Consensus
From MaRDI portal
Publication:5090919
DOI10.4230/LIPIcs.DISC.2018.27zbMath1497.68045arXiv1805.04923OpenAlexW2963922292MaRDI QIDQ5090919
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1805.04923
Analysis of algorithms (68W40) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (2)
Asynchronous fully-decentralized SGD in the cluster-based model ⋮ Wait-free approximate agreement on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability of leaderless discrete-time multi-agent systems
- Multidimensional agreement in Byzantine systems
- Optimal Byzantine-resilient convergence in uni-dimensional robot networks
- A new fault-tolerant algorithm for clock synchronization
- The Heard-Of model: computing in distributed systems with benign faults
- The Total s-Energy of a Multiagent System
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Reaching approximate agreement in the presence of faults
- Fast, Robust, Quantizable Approximate Consensus *
- Time is not a healer
- Tight Bounds for Asymptotic and Approximate Consensus
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Stability of multiagent systems with time-dependent communication links
- Principles of Distributed Systems
This page was built for publication: Fast Multidimensional Asymptotic and Approximate Consensus
