ε-agreement is solvable in every CUB space, and simplex agreement on a simplicial complex C is solvable for n+1 processes iff C is (n-1)-connected.
Byzantine Approximate Agreement on Graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DC 2representative citing papers
citing papers explorer
-
Solving Approximate Agreement on continuous and discrete spaces
ε-agreement is solvable in every CUB space, and simplex agreement on a simplicial complex C is solvable for n+1 processes iff C is (n-1)-connected.