Fast Distributed Algorithms for Computing Separable Functions

DOI10.1109/TIT.2008.924648MaRDI QIDQ3604693zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Distributed systems (68M14) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

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

Cited in

(25)

• Fair distributed computation of reactive functions
• Distributed function calculation over noisy networks
• Multi-client functional encryption for separable functions
• Polynomial anonymous dynamic distributed computing without a unique leader
• Faster rumor spreading with multiple calls
• Distributed computation in dynamic networks via random walks
• Distributed agreement in dynamic peer-to-peer networks
• Simple and optimal randomized fault-tolerant rumor spreading
• The complexity of data aggregation in directed networks
• scientific article; zbMATH DE number 5972643 (Why is no real title available?)
• Towards a queueing-based framework for in-network function computation
• Asynchronous privacy-preserving iterative computation on peer-to-peer networks
• Probabilistic consensus via polling and majority rules
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Distributed Linearly Separable Computation
• Polynomial anonymous dynamic distributed computing without a unique leader
• Computing separable functions via gossip
• Randomized rumour spreading: the effect of the network topology
• Rumor spreading in social networks
• Mathematical Foundations of Computer Science 2003
• Towards robust and efficient computation in dynamic peer-to-peer networks
• Rumor spreading and vertex expansion
• Ultra-fast rumor spreading in social networks
• Asymptotics for push on the complete graph
• Anonymous adversarial dynamic networks with logarithmic memory and communication

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)