The time complexity of consensus under oblivious message adversaries

Cites Work

Unnamed Item
A non-topological proof for the impossibility of \(k\)-set agreement
Synchronous consensus under hybrid process and link failures
On linear-time data dissemination in dynamic rooted trees
Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
Consensus in rooted dynamic networks with short-lived stability
On the radius of nonsplit graphs and information dissemination in dynamic networks
A characterization of oblivious message adversaries for which consensus is solvable
The Heard-Of model: computing in distributed systems with benign faults
Agreement in synchronous networks with ubiquitous faults
Round-by-round fault detectors (extended abstract)
Distributed computation in dynamic networks
Coordinated consensus in dynamic networks
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms
A combinatorial characterization of the distributed 1-solvable tasks
Impossibility Results and Lower Bounds for Consensus under Link Failures
Impossibility of distributed consensus with one faulty process
Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
Bounds on the Step and Namespace Complexity of Renaming
Time is not a healer
Topological Characterization of Consensus under General Message Adversaries
Timeliness, failure-detectors, and consensus performance
Tight Bounds for Asymptotic and Approximate Consensus
A topological perspective on distributed network algorithms
Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

This page was built for publication: The time complexity of consensus under oblivious message adversaries