Lower Bounds on Information Transfer in Distributed Computations

DOI10.1145/322186.322200MaRDI QIDQ3880279zbMATH OpenOpenAlexFDO

Authors Harold Abelson

Publication date 1980

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322186.322200

zbMATH Keywords

computing a differentiable real- valued functiondistributed networkdistributed systemsinterprocessor communicationmeasuring computational complexityparallel processing

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cited in

(15)

• Communication complexity
• Communication complexity of convex optimization
• A distributed selection algorithm and its expected communication complexity
• Trade-offs between communication and space
• Communication complexity and combinatorial lattice theory
• The communication complexity of computing differentiable functions in a multicomputer network
• On the communication complexity of Lipschitzian optimization for the coordinated model of computation
• A lower bound on computational complexity given by revelation mechanisms
• The communication requirements of efficient allocations and supporting prices
• On the message complexity of distributed problems
• The layer complexity of Arthur-Merlin-like communication
• Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
• On the black-box use of somewhat homomorphic encryption in noninteractive two-party protocols
• Communication complexity of PRAMs
• On the design of complex organizations and distributive algorithms

This page was built for publication: Lower Bounds on Information Transfer in Distributed Computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880279)