The following pages link to (Q2965522):
Displaying 9 items.
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation (Q1578430) (← links)
- Communication lower bounds for distributed-memory matrix multiplication (Q1886368) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Superboundary exchange: A technique for reducing communication in distributed implementations of iterative computations (Q2751906) (← links)
- Amortized Communication Complexity of Distributions (Q3638077) (← links)
- (Q4250786) (← links)
- On the average communication complexity of asynchronous distributed algorithms (Q4369868) (← links)
- Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
- The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)