The Adversarial Noise Threshold for Distributed Protocols
From MaRDI portal
Publication:4575595
DOI10.1137/1.9781611974331.ch18zbMath1410.68050arXiv1412.8097OpenAlexW1894162430MaRDI QIDQ4575595
Leonard J. Schulman, William M. Hoza
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.8097
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Network protocols (68M12)
Related Items (7)
Distributed computations in fully-defective networks ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Making asynchronous distributed computations robust to noise ⋮ Reliable communication over highly connected noisy networks ⋮ Unnamed Item ⋮ Noisy beeping networks
This page was built for publication: The Adversarial Noise Threshold for Distributed Protocols