Fast Distributed Algorithms for Computing Separable Functions
From MaRDI portal
Publication:3604693
DOI10.1109/TIT.2008.924648zbMath1332.68279MaRDI 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
68W10: Parallel algorithms in computer science
68M14: Distributed systems
68W15: Distributed algorithms
Related Items
Polynomial anonymous dynamic distributed computing without a unique leader, Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations, Randomized Rumour Spreading: The Effect of the Network Topology, Unnamed Item, Unnamed Item, Unnamed Item, Asymptotics for push on the complete graph, Simple and optimal randomized fault-tolerant rumor spreading, Asynchronous privacy-preserving iterative computation on peer-to-peer networks, Probabilistic consensus via polling and majority rules, Rumor spreading in social networks, Multi-client functional encryption for separable functions, Polynomial anonymous dynamic distributed computing without a unique leader, Faster rumor spreading with multiple calls, Rumor spreading with bounded in-degree, Distributed computation in dynamic networks via random walks, Distributed agreement in dynamic peer-to-peer networks, The Complexity of Data Aggregation in Directed Networks