Login / Signup

Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! [Extended Version].

Pierre CivitMuhammad Ayaz DzulfikarSeth GilbertVincent GramoliRachid GuerraouiJovan KomatovicManuel Vidigueira
Published in: CoRR (2022)
Keyphrases
  • lower bound
  • upper bound
  • worst case
  • fault tolerant
  • computer vision
  • decision trees
  • error bounds
  • generalization error bounds
  • database
  • real time
  • data sets
  • neural network
  • learning algorithm
  • social networks