Fast Distributed Algorithms for Computing Separable Functions

@article{MoskAoyama2008FastDA,
  title={Fast Distributed Algorithms for Computing Separable Functions},
  author={Damon Mosk-Aoyama and Devavrat Shah},
  journal={IEEE Transactions on Information Theory},
  year={2008},
  volume={54},
  pages={2997-3007}
}
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on local information, has applications in sensor, peer-to-peer, and ad hoc networks. The task of computing separable functions, which can be written as linear combinations of functions of individual variables, is studied in this context. Known iterative algorithms for averaging can be used to compute the normalized values… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 171 citations. REVIEW CITATIONS
115 Citations
29 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 115 extracted citations

172 Citations

02040'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 172 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…