Tolerating a linear number of faults in networks of bounded degree

DOI10.1006/inco.1994.1099zbMath0938.68524OpenAlexW2004422728MaRDI QIDQ1342521

Eli Upfal

Publication date: 21 June 2000

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1099

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Percolation on finite graphs and isoperimetric inequalities. ⋮ Simple and optimal randomized fault-tolerant rumor spreading ⋮ Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213] ⋮ Robust gossiping with an application to consensus ⋮ Practical provably secure flooding for blockchains ⋮ On private computation in incomplete networks ⋮ Doing-it-all with bounded work and communication ⋮ Efficient reliable communication over partially authenticated networks ⋮ A robust randomized algorithm to perform independent tasks ⋮ Reliable communication over partially authenticated networks ⋮ Leader Election in Sparse Dynamic Networks with Churn ⋮ Efficient gossip and robust distributed computation ⋮ Unnamed Item ⋮ Scalable secure storage when half the system is faulty ⋮ Distributed agreement in dynamic peer-to-peer networks