Parameter-independent Iterative Approximate Byzantine Consensus
classification
💻 cs.DC
keywords
approximatebyzantineconsensusiterativealgorithmsexplicitexplorefaults
read the original abstract
In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.