Topological characterization of consensus in distributed systems
From MaRDI portal
Cites work
- A characterization of oblivious message adversaries for which consensus is solvable
- A generalized asynchronous computability theorem
- A layered analysis of consensus
- An asynchronous computability theorem for fair adversaries
- Atomic snapshots of shared memory
- Back to the coordinated attack problem
- Beyond Lamport's Happened-before
- Closed schedulers: a novel technique for analyzing asynchronous protocols
- Communication-efficient leader election and consensus with limited link synchrony
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- Consensus in rooted dynamic networks with short-lived stability
- Defining liveness
- Distributed agreement in the presence of processor and communication faults
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- scientific article; zbMATH DE number 1461253 (Why is no real title available?)
- scientific article; zbMATH DE number 7650867 (Why is no real title available?)
- scientific article; zbMATH DE number 7829305 (Why is no real title available?)
- Hundreds of impossibility results for distributed computing
- Impossibility of distributed consensus with one faulty process
- Impossibility Results and Lower Bounds for Consensus under Link Failures
- On the minimal synchronism needed for distributed consensus
- Synchronous t-resilient consensus in arbitrary graphs
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- The asynchronous bounded-cycle model
- The Byzantine Generals Problem
- The Heard-Of model: computing in distributed systems with benign faults
- The time complexity of consensus under oblivious message adversaries
- The topological structure of asynchronous computability
- Time is not a healer (preliminary version)
- Time, clocks, and the ordering of events in a distributed system
- Topological Characterization of Consensus under General Message Adversaries
- Unreliable failure detectors for reliable distributed systems
- Valency-based consensus under message adversaries without limit-closure
This page was built for publication: Topological characterization of consensus in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993539)
