Lower bounds in distributed computing

DOI10.1007/3-540-40026-5_1MaRDI QIDQ2766858zbMATH OpenFDO

Authors Eric Ruppert, Faith E. Fich

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40026-5_1

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Hundreds of impossibility results for distributed computing
• What can be computed in a distributed system?
• A pleasant stroll through the land of distributed machines, computation, and universality
• Power and limits of distributed computing shared memory models
• Impossibility results for distributed computing

Cited in

(12)

• Optimal lower bounds for some distributed algorithms for a complete network of processors
• A simple proof of the uniform consensus synchronous lower bound.
• Fooling views: a new lower bound technique for distributed computations under congestion
• Performing work in broadcast networks
• Fundamental limitation on achievable decentralized performance
• scientific article; zbMATH DE number 6691438 (Why is no real title available?)
• Power and limits of distributed computing shared memory models
• Impossibility results for distributed computing
• On Distributed Computations with Limited Resources
• Hundreds of impossibility results for distributed computing
• What can be computed in a distributed system?
• Theory of Cryptography

This page was built for publication: Lower bounds in distributed computing

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