Pages that link to "Item:Q3880279"
From MaRDI portal
The following pages link to Lower Bounds on Information Transfer in Distributed Computations (Q3880279):
Displaying 15 items.
- Communication complexity of PRAMs (Q913504) (← links)
- On the design of complex organizations and distributive algorithms (Q915428) (← links)
- Communication complexity (Q1069701) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- A distributed selection algorithm and its expected communication complexity (Q1193632) (← links)
- Trade-offs between communication and space (Q1201877) (← links)
- Communication complexity and combinatorial lattice theory (Q1309387) (← links)
- The communication complexity of computing differentiable functions in a multicomputer network (Q1318701) (← links)
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- A lower bound on computational complexity given by revelation mechanisms (Q1920945) (← links)
- The communication requirements of efficient allocations and supporting prices (Q2496786) (← links)
- On the message complexity of distributed problems (Q3345763) (← links)
- (Q5158502) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)