A necessary condition for Byzantine \(k\)-set agreement

DOI10.1016/j.ipl.2016.06.009zbMath1371.68032arXiv1512.06227OpenAlexW2270821346MaRDI QIDQ738885

Damien Imbs, Zohir Bouzid, Michel Raynal

Publication date: 16 August 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.06227

zbMATH Keywords

algorithms\(k\)-set agreementmessage-passing systematomic read/write registerByzantine process

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ On the Validity of Consensus

Cites Work

• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• The Byzantine Generals Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A necessary condition for Byzantine \(k\)-set agreement