Byzantine vector consensus in complete graphs
Authors:
Open Access
- 22 July 2013
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 65-73
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Approximating Tverberg points in linear time for any fixed dimension2012
- Approximate centerpoints with proofsComputational Geometry, 2010
- Optimal Resilience Asynchronous Approximate Agreement2005
- Algorithms for center and Tverberg points2004
- Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 RoundsSIAM Journal on Computing, 1998
- Muteness detectors for consensus with Byzantine processes1998
- Computing a centerpoint of a finite planar set of points in linear timeDiscrete & Computational Geometry, 1994
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985