The complexity of data aggregation in directed networks

DOI10.1007/978-3-642-24100-0_40zbMATH Open1350.68047OpenAlexW191272617MaRDI QIDQ3095346FDOQ3095346

Authors Fabian Kuhn, Rotem Oshman

Publication date 28 October 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24100-0_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• The complexity of data aggregation in static and dynamic wireless sensor networks
• Almost-optimal gossip-based aggregate computation
• Networks cannot compute their diameter in sublinear time
• A note on efficient aggregate queries in sensor networks
• A note on efficient aggregate queries in sensor networks

Cites work

• A distributed selection algorithm and its expected communication complexity
• A note on efficient aggregate queries in sensor networks
• Communication Complexity
• Distributed computation in dynamic networks
• Distributed computation of the mode
• Fast Distributed Algorithms for Computing Separable Functions
• On the distributional complexity of disjointness
• The Probabilistic Communication Complexity of Set Intersection

Cited in

(13)

• Lower and upper competitive bounds for online directed graph exploration
• Towards robust and efficient computation in dynamic peer-to-peer networks
• A topological perspective on distributed network algorithms
• scientific article; zbMATH DE number 7407798 (Why is no real title available?)
• Synchronous \(t\)-resilient consensus in arbitrary graphs
• On the treewidth of dynamic graphs
• Bounded-contention coding for the additive network model
• Distributed Testing of Distance-k Colorings
• Some lower bounds in dynamic networks with oblivious adversaries
• Non-adaptive data structure bounds for dynamic predecessor
• Upper and lower bounds for deterministic broadcast in powerline communication networks
• Exploration of dynamic tori by multiple agents
• Data complexity measured by principal graphs

This page was built for publication: The complexity of data aggregation in directed networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095346)