A coding theorem for distributed computation

DOI10.1145/195058.195462MaRDI QIDQ2817675zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cited in

(22)

• The adversarial noise threshold for distributed protocols
• Making Asynchronous Distributed Computations Robust to Channel Noise
• Reliable Computations Based on Locally Decodable Codes
• The cost of fault tolerance in multi-party communication complexity
• Capacity of interactive communication over erasure channels and channels with feedback
• Algorithms for noisy broadcast with erasures
• Distributed CONGEST Algorithms against Mobile Adversaries
• scientific article; zbMATH DE number 7564410 (Why is no real title available?)
• Binomial coding in distributed arbitration systems
• Coded Computing: Mitigating Fundamental Bottlenecks in Large-Scale Distributed Computing and Machine Learning
• Computing in fault tolerant broadcast networks and noisy decision trees
• scientific article; zbMATH DE number 6866311 (Why is no real title available?)
• Interactive non-malleable codes
• Capacity Theorems for Distributed Index Coding
• An improvement of the tree code construction
• Noisy beeping networks
• Authenticated adversarial routing
• Making asynchronous distributed computations robust to noise
• Reliable communication over highly connected noisy networks
• A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
• Reliable communication over highly connected noisy networks
• Palette-alternating tree codes

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)