Valency-based consensus under message adversaries without limit-closure

DOI10.1007/978-3-030-86593-1_32MaRDI QIDQ2140525zbMATH OpenOpenAlexFDO

Authors Kyrill Winkler, Ulrich Schmid, Thomas Nowak

Publication date 20 May 2022

Full work available at URL https://doi.org/10.1007/978-3-030-86593-1_32

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A characterization of oblivious message adversaries for which consensus is solvable
• Beyond Lamport's Happened-before
• Consensus in rooted dynamic networks with short-lived stability
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• scientific article; zbMATH DE number 7650867 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Heard-Of model: computing in distributed systems with benign faults
• Topological Characterization of Consensus under General Message Adversaries

Cited in

(1)

• Topological characterization of consensus in distributed systems

This page was built for publication: Valency-based consensus under message adversaries without limit-closure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140525)