Fast Distributed Algorithms for Computing Separable Functions

DOI10.1109/TIT.2008.924648zbMath1332.68279OpenAlexW2078381259MaRDI QIDQ3604693

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

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

Related Items (18)

Simple and optimal randomized fault-tolerant rumor spreading ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ Asynchronous privacy-preserving iterative computation on peer-to-peer networks ⋮ Probabilistic consensus via polling and majority rules ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Faster rumor spreading with multiple calls ⋮ Rumor spreading in social networks ⋮ Asymptotics for push on the complete graph ⋮ Rumor spreading with bounded in-degree ⋮ Multi-client functional encryption for separable functions ⋮ The Complexity of Data Aggregation in Directed Networks ⋮ Polynomial anonymous dynamic distributed computing without a unique leader ⋮ Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distributed computation in dynamic networks via random walks ⋮ Distributed agreement in dynamic peer-to-peer networks

This page was built for publication: Fast Distributed Algorithms for Computing Separable Functions