Lower bounds for in-network computation of arbitrary functions
From MaRDI portal
Publication:1981801
DOI10.1007/s00446-021-00394-7OpenAlexW3157422983MaRDI QIDQ1981801
Pooja Vyavahare, Amitabha Bagchi, Iqra Altaf Gillani
Publication date: 6 September 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.03741
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards a queueing-based framework for in-network function computation
- Stability of token passing rings
- A queueing network-based distributed Laplacian solver for directed graphs
- Hitting and commute times in large graphs are often misleading
- Distributed Function Computation Over a Rooted Directed Tree
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Stability conditions for some distributed systems: buffered random access systems
- Geographic Gossip: Efficient Averaging for Sensor Networks
- Stability of N interacting queues in random-access systems
- Computing separable functions via gossip
- Time and Energy Complexity of Function Computation Over Networks
- Information-Theoretic Lower Bounds for Distributed Function Computation
- Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
- Order-Optimal Consensus Through Randomized Path Averaging
- On Distributed Function Computation in Structure-Free Random Wireless Networks
- An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
This page was built for publication: Lower bounds for in-network computation of arbitrary functions
