Gap Theorems for Distributed Computation
From MaRDI portal
Publication:4032945
gapnetworkscommunicationdistributed algorithmsdeterministic algorithmgap theorembit complexityprocessorsmessage complexitymessagesring of processors
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Recommendations
Cited in
(11)- Computing on anonymous networks with sense of direction
- A coding theorem for distributed computation
- The communication complexity for decentralized evaluation of functions
- Computing on an anonymous ring
- Language complexity on the synchronous anonymous ring
- Hundreds of impossibility results for distributed computing
- Weak models of distributed computing, with connections to modal logic
- Computing functions on asynchronous anonymous networks
- Computing on a partially eponymous ring
- scientific article; zbMATH DE number 17531 (Why is no real title available?)
- Toward computability of trace distance discord
This page was built for publication: Gap Theorems for Distributed Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032945)