Centroid approximation with multidimensional approximate agreement protocols

DOI10.1016/J.TCS.2026.116044MaRDI QIDQ7263466zbMATH OpenFDO

Authors Darya Melnyk

Publication date 12 June 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116044

zbMATH Keywords

barycenterByzantine fault tolerancecollaborative learningaveraging agreementvector consensus

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Generalization of Radon's Theorem
• A lower bound for the time to assure interactive consistency
• A resilient convex combination for consensus-based distributed algorithms
• Asynchronous byzantine agreement protocols
• Byzantine agreement with median validity
• Byzantine preferential voting
• Byzantine vector consensus in complete graphs
• Fast multidimensional asymptotic and approximate consensus
• HotStuff
• Impossibility of distributed consensus with one faulty process
• Introduction to Reliable and Secure Distributed Programming
• Least squares quantization in PCM
• Multidimensional agreement in Byzantine systems
• Multidimensional approximate agreement in Byzantine asynchronous systems
• On k -set consensus problems in asynchronous systems
• On the Validity of Consensus
• Principles of Distributed Systems
• Reaching approximate agreement in the presence of faults
• Relaxed Byzantine vector consensus
• Resilient distributed vector consensus using centerpoint

This page was built for publication: Centroid approximation with multidimensional approximate agreement protocols

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