Tight bounds for connectivity and set agreement in Byzantine synchronous systems

DOI10.4230/LIPICS.DISC.2017.35zbMATH Open1515.68072MaRDI QIDQ6487508FDOQ6487508

Authors: Hammurabi Mendes, Maurice Herlihy 

Publication date: 3 February 2023

Recommendations

• Tight bounds for \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• A necessary condition for Byzantine \(k\)-set agreement
• scientific article; zbMATH DE number 2006649

zbMATH Keywords

topologyconnectivity\(k\)-set agreementByzantine synchronous system

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cited In (8)

• Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures
• An axiomatic approach to computing the connectivity of synchronous and asynchronous systems
• Title not available (Why is that?)
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• Optimal algorithms for synchronous Byzantine \(k\)-set agreement
• A necessary condition for Byzantine \(k\)-set agreement
• Tight bound on mobile Byzantine agreement
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems

This page was built for publication: Tight bounds for connectivity and set agreement in Byzantine synchronous systems

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