Robust gossiping with an application to consensus
From MaRDI portal
(Redirected from Publication:856404)
Recommendations
- Robust gossip-based aggregation: a practical point of view
- Broadcast Gossip Algorithms for Consensus on Strongly Connected Digraphs
- A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
- Efficient gossip and robust distributed computation
- Efficient gossip and robust distributed computation
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- Broadcast Gossip Ratio Consensus: Asynchronous Distributed Averaging in Strongly Connected Networks
- Broadcast Gossip Algorithms for Consensus
- Gossip consensus algorithms via quantized communication
- Almost sure exponential convergence to consensus of random gossip algorithms
Cites work
- scientific article; zbMATH DE number 1306905 (Why is no real title available?)
- scientific article; zbMATH DE number 2013838 (Why is no real title available?)
- scientific article; zbMATH DE number 1849959 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- scientific article; zbMATH DE number 3188071 (Why is no real title available?)
- A lower bound for the time to assure interactive consistency
- A survey of gossiping and broadcasting in communication networks
- Bounds on information exchange for Byzantine agreement
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Efficient gossip and robust distributed computation
- Fast gossiping with short unreliable messages
- Fault Tolerance in Networks of Bounded Degree
- Fault-tolerant broadcasting and gossiping in communication networks
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- Impossibility of distributed consensus with one faulty process
- Information dissemination in distributed systems with faulty units
- Message-optimal protocols for Byzantine Agreement
- Methods and problems of communication in usual networks
- On the message complexity of binary Byzantine agreement under crash failures
- Performing Work Efficiently in the Presence of Faults
- Probability and Computing
- Ramanujan graphs
- Reaching Agreement in the Presence of Faults
- Resource discovery in distributed networks
- Spatial gossip and resource location protocols
- Telephone Problems with Failures
- The Byzantine Generals Problem
- Tolerating a linear number of faults in networks of bounded degree
Cited in
(27)- Fault-tolerant graph realizations in the congested clique
- Broadcast Gossip Algorithms for Consensus
- Quiescence of self-stabilizing gossiping among mobile agents in graphs
- Keeping track of the latest gossip in a distributed system
- Gossiping by processors prone to omission failures
- How efficient can gossip be? (On the cost of resilient information exchange)
- Bounded Confidence Gossip Algorithms for Opinion Formation and Data Clustering
- Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- The logic of gossiping
- Fast scalable deterministic consensus for crash failures
- Efficient gossip and robust distributed computation
- Fast agreement in networks with Byzantine nodes
- On the Communication Surplus Incurred by Faulty Processors
- Robust gossip-based aggregation: a practical point of view
- Time and Communication Efficient Consensus for Crash Failures
- Brief Announcement: Improved Consensus in Quantum Networks
- Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
- Efficient gossip and robust distributed computation
- Distributed fast crash-tolerant consensus with nearly-linear quantum communication
- Almost sure exponential convergence to consensus of random gossip algorithms
- Communication-efficient randomized consensus
- New bounds on the minimum number of calls in failure‐tolerant gossiping
- scientific article; zbMATH DE number 7440211 (Why is no real title available?)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip
- Doing-it-all with bounded work and communication
- Asynchronous gossip
This page was built for publication: Robust gossiping with an application to consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856404)
