Aggregation in dynamic networks
From MaRDI portal
Publication:2933795
DOI10.1145/2332432.2332468zbMath1301.68202OpenAlexW2085128250MaRDI QIDQ2933795
Alejandro Cornejo, Calvin Newport
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2332432.2332468
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (6)
Some lower bounds in dynamic networks with oblivious adversaries ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ The complexity of data aggregation in static and dynamic wireless sensor networks ⋮ Smoothed analysis of dynamic networks ⋮ The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks ⋮ Convergecast Tree on Temporal Graphs
This page was built for publication: Aggregation in dynamic networks
