On the communication complexity of distributed algebraic computation
From MaRDI portal
Recommendations
Cited in
(11)- The communication complexity of computing differentiable functions in a multicomputer network
- One-way communication complexity of computing a collection of rational functions
- Communication complexity and orthogonal polynomials
- Randomized communication complexity for linear algebra problems over finite fields
- scientific article; zbMATH DE number 5972643 (Why is no real title available?)
- On the Communication Complexity of Solving a Polynomial Equation
- scientific article; zbMATH DE number 1223708 (Why is no real title available?)
- On the average communication complexity of asynchronous distributed algorithms
- The Communication Complexity of Distributed epsilon-Approximations
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
- Optimal One-Pass Nonparametric Estimation Under Memory Constraint
This page was built for publication: On the communication complexity of distributed algebraic computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4285628)