Distributed computations in fully-defective networks

DOI10.1007/s00446-023-00452-2arXiv2205.11148MaRDI QIDQ6091854

Gal Sela, Ran Gelles, Shir Cohen, Keren Censor-Hillel

Publication date: 21 November 2023

Published in: Distributed Computing, Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.11148

zbMATH Keywords

Robbins' theoremfully-defective networksnoise resilience

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Agreement under faulty interfaces
• Operating systems. An advanced course
• Interactive communication with unknown noise rate
• A simple test on 2-vertex- and 2-edge-connectivity
• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• On finding an ear decomposition of an undirected graph distributively
• A coding theorem for distributed computation
• Efficient Coding for Interactive Communication
• Interactive Coding for Multiparty Protocols
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• Distributed agreement in the presence of processor and communication faults
• Impossibility of distributed consensus with one faulty process
• The Byzantine generals strike again
• Reliable communication in networks with Byzantine link failures
• Non-Separable and Planar Graphs
• Distributed Computing: A Locality-Sensitive Approach
• The Adversarial Noise Threshold for Distributed Protocols
• Coding for Interactive Communication: A Survey
• Fault-Tolerant Design
• Fault-Tolerant Systems
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Efficient Multiparty Interactive Coding for Insertions, Deletions, and Substitutions
• Multiparty Interactive Communication with Private Channels
• Constant-Rate Interactive Coding Is Impossible, Even in Constant-Degree Networks
• Low Congestion Cycle Covers and Their Applications
• Fault-Tolerant Message-Passing Distributed Systems
• Deterministic coding for interactive communication
• A Theorem on Graphs, with an Application to a Problem of Traffic Control

This page was built for publication: Distributed computations in fully-defective networks