A topological characterization of stabilizing consensus
From MaRDI portal
Cites work
- A characterization of oblivious message adversaries for which consensus is solvable
- A new fault-tolerant algorithm for clock synchronization
- Agreement in synchronous networks with ubiquitous faults
- An asynchronous computability theorem for fair adversaries
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Asynchronous approximate agreement
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- Consensus in rooted dynamic networks with short-lived stability
- Consensus theoretic classification methods
- Defining liveness
- Distributed Anonymous Discrete Function Computation
- Exploiting omissive faults in synchronous approximate agreement
- Fast multidimensional asymptotic and approximate consensus
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 7829305 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- MinMax algorithms for stabilizing consensus
- Multidimensional agreement in Byzantine systems
- Principles of Distributed Systems
- Reaching approximate agreement in the presence of faults
- Round-Oblivious Stabilizing Consensus in Dynamic Networks
- Self-stabilization
- Semi-Open Sets and Semi-Continuity in Topological Spaces
- Stability of multiagent systems with time-dependent communication links
- Synchronous consensus under hybrid process and link failures
- The Heard-Of model: computing in distributed systems with benign faults
- The topological structure of asynchronous computability
- Tight Bounds for Asymptotic and Approximate Consensus
- Time is not a healer (preliminary version)
- Topological characterization of consensus in distributed systems
- Topological Characterization of Consensus under General Message Adversaries
- Uniform consensus is harder than consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
This page was built for publication: A topological characterization of stabilizing consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312784)
