Round-Oblivious Stabilizing Consensus in Dynamic Networks
From MaRDI portal
Round-Oblivious Stabilizing Consensus in Dynamic Networks
Recommendations
- Consensus in rooted dynamic networks with short-lived stability
- A characterization of oblivious message adversaries for which consensus is solvable
- Coordinated consensus in dynamic networks
- A characterization of dynamic networks where consensus is solvable
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
Cites work
- A characterization of oblivious message adversaries for which consensus is solvable
- Approximate consensus in highly dynamic networks: the role of averaging algorithms
- Consensus in rooted dynamic networks with short-lived stability
- Coordinated consensus in dynamic networks
- Distributed computation in dynamic networks
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- scientific article; zbMATH DE number 2061537 (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
- Synchronous consensus under hybrid process and link failures
- The Heard-Of model: computing in distributed systems with benign faults
- The Theta-Model: achieving synchrony without clocks
- Time is not a healer (preliminary version)
Cited in
(3)
This page was built for publication: Round-Oblivious Stabilizing Consensus in Dynamic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488436)
