A coding theorem for distributed computation
DOI10.1145/195058.195462zbMATH Open1344.68035OpenAlexW2077242989MaRDI QIDQ2817675FDOQ2817675
Authors: Sridhar Rajagopalan, Leonard J. Schulman 
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195462
Recommendations
- Gap Theorems for Distributed Computation
- Distributed coding in a multiple access environment
- Distributed Arithmetic Coding for the Slepian–Wolf Problem
- Capacity Theorems for Distributed Index Coding
- Coded Distributed Computing With Partial Recovery
- Some Results on Distributed Source Coding for Interactive Function Computation
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- scientific article; zbMATH DE number 2013823
- Coded Computation Over Heterogeneous Clusters
- Fundamental Limits of Distributed Linear Encoding
Coding theorems (Shannon theory) (94A24) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cited In (23)
- Computing in fault tolerant broadcast networks and noisy decision trees
- Noisy beeping networks
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Palette-alternating tree codes
- Title not available (Why is that?)
- An improvement of the tree code construction
- The adversarial noise threshold for distributed protocols
- Making asynchronous distributed computations robust to noise
- Reliable communication over highly connected noisy networks
- Reliable communication over highly connected noisy networks
- Algorithms for noisy broadcast with erasures
- Binomial coding in distributed arbitration systems
- Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
- Reliable Computations Based on Locally Decodable Codes
- Capacity of interactive communication over erasure channels and channels with feedback
- Distributed CONGEST Algorithms against Mobile Adversaries
- Interactive non-malleable codes
- Authenticated adversarial routing
- Title not available (Why is that?)
- The cost of fault tolerance in multi-party communication complexity
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Distributed computations in fully-defective networks
- Capacity Theorems for Distributed Index Coding
This page was built for publication: A coding theorem for distributed computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817675)
