Fast Distributed Algorithms for Computing Separable Functions
From MaRDI portal
Publication:3604693
DOI10.1109/TIT.2008.924648zbMATH Open1332.68279OpenAlexW2078381259MaRDI QIDQ3604693FDOQ3604693
Authors: Damon Mosk-Aoyama, Devavrat Shah 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.924648
Recommendations
- On Distributed Computing for Functions With Certain Structures
- Distributed Linearly Separable Computation
- An algorithm for distributed computation of FFTs
- Fast Distributed Gradient Methods
- Computing separable functions via gossip
- Parameterized distributed algorithms
- scientific article; zbMATH DE number 996442
- scientific article; zbMATH DE number 701866
- Publication:3030183
Parallel algorithms in computer science (68W10) Distributed algorithms (68W15) Distributed systems (68M14)
Cited In (24)
- Distributed agreement in dynamic peer-to-peer networks
- Rumor spreading in social networks
- Faster rumor spreading with multiple calls
- Mathematical Foundations of Computer Science 2003
- Simple and optimal randomized fault-tolerant rumor spreading
- Randomized rumour spreading: the effect of the network topology
- Polynomial anonymous dynamic distributed computing without a unique leader
- Fair distributed computation of reactive functions
- Multi-client functional encryption for separable functions
- Ultra-fast rumor spreading in social networks
- Asymptotics for push on the complete graph
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks
- Polynomial anonymous dynamic distributed computing without a unique leader
- Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
- Distributed function calculation over noisy networks
- Distributed Linearly Separable Computation
- Probabilistic consensus via polling and majority rules
- Title not available (Why is that?)
- Towards robust and efficient computation in dynamic peer-to-peer networks
- Rumor spreading and vertex expansion
- The complexity of data aggregation in directed networks
- Towards a queueing-based framework for in-network function computation
- Distributed computation in dynamic networks via random walks
- Computing separable functions via gossip
This page was built for publication: Fast Distributed Algorithms for Computing Separable Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604693)
