Pith. sign in

Title resolution pending

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DC 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Byzantine Approximate Agreement on Graphs

cs.DC · 2019-08-07 · conditional · novelty 8.0

Byzantine approximate agreement on chordal graphs and cycle-free semilattices is solvable in O(log N) asynchronous rounds when n > (ω+1)f, and synchronous exact convex consensus has tight resilience Θ(f).

citing papers explorer

Showing 1 of 1 citing paper.

  • Byzantine Approximate Agreement on Graphs cs.DC · 2019-08-07 · conditional · none · ref 8

    Byzantine approximate agreement on chordal graphs and cycle-free semilattices is solvable in O(log N) asynchronous rounds when n > (ω+1)f, and synchronous exact convex consensus has tight resilience Θ(f).