Computing separable functions via gossip
From MaRDI portal
Publication:5177272
DOI10.1145/1146381.1146401zbMath1314.68048OpenAlexW2119098504MaRDI QIDQ5177272
Damon Mosk-Aoyama, Devavrat Shah
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1146381.1146401
Stochastic network models in operations research (90B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20) Network protocols (68M12)
Related Items (20)
On fast and robust information spreading in the vertex-congest model ⋮ Leader nodes in communities for information spreading ⋮ Towards worst-case churn resistant peer-to-peer systems ⋮ Braid Chain Radio Communication ⋮ A stochastic process on a network with connections to Laplacian systems of equations ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Rumor Spreading with No Dependence on Conductance ⋮ Distributed Averaging in Opinion Dynamics ⋮ Peer counting and sampling in overlay networks based on random walks ⋮ Pathogen spread on coupled networks: effect of host and network properties on transmission thresholds ⋮ Order optimal information spreading using algebraic gossip ⋮ Identifying frequent items in a network using gossip ⋮ Lower bounds for in-network computation of arbitrary functions ⋮ Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing ⋮ In-network estimation of frequency moments ⋮ LiMoSense: live monitoring in dynamic sensor networks ⋮ Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions ⋮ Discovery Through Gossip ⋮ Multi-client functional encryption for separable functions ⋮ The firing squad problem revisited
This page was built for publication: Computing separable functions via gossip
