Efficient distributed algorithms for holistic aggregation functions on random regular graphs
Authors:
- 27 May 2021
- journal article
- research article
- Published by Springer Nature in Science China Information Sciences
- Vol. 65 (5) , 1-19
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Xpander2016
- Fat-FREE Topologies2016
- Xpander2015
- Latency-minimizing data aggregation in wireless sensor networks under physical interference modelAd Hoc Networks, 2014
- Tight bounds for distributed selection2007
- Models of Random Regular Graphs1999
- Shortest-Path Routing in Arbitrary NetworksJournal of Algorithms, 1999
- Packet routing and job-shop scheduling inO(congestion+dilation) stepsCombinatorica, 1994
- Private vs. common random bits in communication complexityInformation Processing Letters, 1991
- A survey of the theory of hypercube graphsComputers & Mathematics with Applications, 1988