Tolerating linear number of faults in networks of bounded degree

DOI10.1145/135419.135437zbMath1369.68062OpenAlexW1964678106MaRDI QIDQ5348837

Eli Upfal

Publication date: 21 August 2017

Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/135419.135437

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (10)

Oblivious transfer in incomplete networks ⋮ Agreement in the presence of faults, on networks of bounded degree ⋮ Broadcast (and Round) Efficient Verifiable Secret Sharing ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Almost-everywhere secure computation with edge corruptions ⋮ Distributed computing in asynchronous networks with byzantine edges ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Fast consensus in networks of bounded degree. ⋮ Efficient constructions for almost-everywhere secure computation

This page was built for publication: Tolerating linear number of faults in networks of bounded degree