Making asynchronous distributed computations robust to noise

DOI10.1007/s00446-018-0343-5zbMath1451.68040arXiv1702.07403MaRDI QIDQ2010600

Bernhard Haeupler, Ran Gelles, Keren Censor-Hillel

Publication date: 27 November 2019

Published in: Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

adversarial noise; computation with noise; interactive coding

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68M14: Distributed systems

68M12: Network protocols

68Q11: Communication complexity, information complexity

Related Items

Distributed computations in fully-defective networks, Noisy beeping networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Agreement under faulty interfaces
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• Sublinear fully distributed partition with applications
• A coding theorem for distributed computation
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
• Toward Coding for Maximum Errors in Interactive Communication
• Efficient Coding for Interactive Communication
• Interactive Coding for Multiparty Protocols
• Coding for interactive communication
• Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
• Complexity of network synchronization
• Impossibility of distributed consensus with one faulty process
• Graph spanners
• Reliable communication in networks with Byzantine link failures
• Synchronizing hypercube networks in the presence of faults
• Distributed Computing: A Locality-Sensitive Approach
• Coding for Interactive Communication Correcting Insertions and Deletions
• The Adversarial Noise Threshold for Distributed Protocols
• Towards Optimal Deterministic Coding for Interactive Communication
• Coding for Interactive Communication: A Survey
• Introduction to Distributed Algorithms
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• Reliable Communication over Highly Connected Noisy Networks
• Interactive channel capacity
• Fast Interactive Coding against Adversarial Noise
• Optimal Coding for Streaming Authentication and Interactive Communication