The Communication Complexity of Distributed epsilon-Approximations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1202979
- scientific article; zbMATH DE number 6691438
- Asymptotic Properties of Distributed and Communicating Stochastic Approximation Algorithms
- Amortized Communication Complexity of Distributions
- The communication complexity for decentralized evaluation of functions
- The communication complexity of distributed task allocation
- On the communication complexity of distributed algebraic computation
- On the average communication complexity of asynchronous distributed algorithms
- Lower bounds on communication complexity in distributed computer networks
Cites work
- An information statistics approach to data stream and communication complexity
- An optimal lower bound for distinct elements in the message passing model
- Communication Complexity
- Concentration of measure and isoperimetric inequalities in product spaces
- Concentration of Measure for the Analysis of Randomized Algorithms
- Constructive discrepancy minimization by walking on the edges
- Deterministic sampling and range counting in geometric data streams
- Elements of Information Theory
- Factorization norms and hereditary discrepancy
- Generalization of a Probability Limit Theorem of Cramer
- Geometric discrepancy. An illustrated guide
- Geometric methods in the study of irregularities of distribution
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- Improved bounds on the sample complexity of learning
- Interactive information complexity
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Mergeable summaries
- On a theorem of Beck
- On range searching in the group model and combinatorial discrepancy
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Range counting over multidimensional data streams
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Tight bounds for distributed functional monitoring
- Tight upper bounds for the discrepancy of half-spaces
Cited in
(6)- On the communication complexity of Lipschitzian optimization for the coordinated model of computation
- CONQUEST: A coarse-grained algorithm for constructing summaries of distributed discrete datasets
- Amortized Communication Complexity of Distributions
- On the average communication complexity of asynchronous distributed algorithms
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Tight bounds for communication-assisted agreement distillation
This page was built for publication: The Communication Complexity of Distributed epsilon-Approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4978194)
