Valency-based consensus under message adversaries without limit-closure
From MaRDI portal
Publication:2140525
DOI10.1007/978-3-030-86593-1_32OpenAlexW3199247995MaRDI QIDQ2140525
Kyrill Winkler, Thomas Nowak, Ulrich Schmid
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_32
Cites Work
- Unnamed Item
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Consensus in rooted dynamic networks with short-lived stability
- A characterization of oblivious message adversaries for which consensus is solvable
- The Heard-Of model: computing in distributed systems with benign faults
- Beyond Lamport's Happened-before
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- Topological Characterization of Consensus under General Message Adversaries
This page was built for publication: Valency-based consensus under message adversaries without limit-closure