Tolerating a linear number of faults in networks of bounded degree
From MaRDI portal
Publication:1342521
DOI10.1006/inco.1994.1099zbMath0938.68524MaRDI QIDQ1342521
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
68M10: Network design and communication in computer systems
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Robust gossiping with an application to consensus, A robust randomized algorithm to perform independent tasks, Reliable communication over partially authenticated networks, Scalable secure storage when half the system is faulty, Percolation on finite graphs and isoperimetric inequalities., Addendum to ``Scalable secure storage when half the system is faulty [inform. comput. 174 (2)(2002) 203-213], Efficient gossip and robust distributed computation