Making Asynchronous Distributed Computations Robust to Channel Noise
From MaRDI portal
Publication:4993319
DOI10.4230/LIPIcs.ITCS.2018.50zbMath1462.68010MaRDI QIDQ4993319
Bernhard Haeupler, Ran Gelles, Keren Censor-Hillel
Publication date: 15 June 2021
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/8318/pdf/LIPIcs-ITCS-2018-50.pdf
coding theory; distributed computation; coding for interactive communication; noise-resilient computation
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Agreement under faulty interfaces
- Efficient perfectly secure message transmission in synchronous networks
- Sublinear fully distributed partition with applications
- A coding theorem for distributed computation
- Breathe before speaking
- 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
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
- Coding for interactive communication
- 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
- 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 error rates for interactive coding I
- Constant-rate coding for multiparty interactive communication is impossible
- Reliable Communication over Highly Connected Noisy Networks
- Interactive channel capacity
- Fast Interactive Coding against Adversarial Noise
- Optimal Coding for Streaming Authentication and Interactive Communication