scientific article
From MaRDI portal
Publication:2965522
DOI10.4230/LIPICS.STACS.2014.627zbMATH Open1359.68027arXiv1307.1805MaRDI QIDQ2965522FDOQ2965522
Authors: Michele Scquizzato, Francesco Silvestri 
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1307.1805
Title of this publication is not available (Why is that?)
Recommendations
- Communication lower bounds for distributed-memory matrix multiplication
- Lower bounds on communication complexity in distributed computer networks
- scientific article; zbMATH DE number 1696663
- Communication Complexity and Lower Bounds on Multilective Computations
- Information-Theoretic Lower Bounds for Distributed Function Computation
- scientific article; zbMATH DE number 4068270
- Lower bounds on communication complexity
- A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
- Lower bounds in communication complexity
Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Distributed systems (68M14)
Cited In (10)
- Superboundary exchange: A technique for reducing communication in distributed implementations of iterative computations
- Equivalence classes and conditional hardness in massively parallel computations
- Lower bounds on communication complexity in distributed computer networks
- Title not available (Why is that?)
- The Communication Complexity of Distributed epsilon-Approximations
- On the average communication complexity of asynchronous distributed algorithms
- Communication lower bounds for distributed-memory matrix multiplication
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Amortized Communication Complexity of Distributions
- On the communication complexity of Lipschitzian optimization for the coordinated model of computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965522)
