Lower bounds for in-network computation of arbitrary functions
type: Item
instance of: scholarly article
title: Lower bounds for in-network computation of arbitrary functions
author: Iqra Altaf Gillani
author: Pooja Vyavahare
author: Amitabha Bagchi
published in: Distributed Computing
publication date: 2021-09-06T00:00:00Z
full work available at URL: https://arxiv.org/abs/1702.03741
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 7391591
zbMATH Keywords: in-network computation
zbMATH Keywords: arbitrary functions
zbMATH Keywords: random walks
zbMATH Keywords: stable rate of computation
MaRDI profile type: Publication
OpenAlex ID: W3157422983
cites work: Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels
cites work: Towards a queueing-based framework for in-network function computation
cites work: Order-Optimal Consensus Through Randomized Path Averaging
cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
cites work: Geographic Gossip: Efficient Averaging for Sensor Networks
cites work: Stability of token passing rings
cites work: A queueing network-based distributed Laplacian solver for directed graphs
cites work: Q3511006
cites work: On Distributed Function Computation in Structure-Free Random Wireless Networks
cites work: Time and Energy Complexity of Function Computation Over Networks
cites work: An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Q3549475
cites work: Q5602045
cites work: Stability of N interacting queues in random-access systems
cites work: Computing separable functions via gossip
cites work: Distributed Function Computation Over a Rooted Directed Tree
cites work: Q3135094
cites work: Stability conditions for some distributed systems: buffered random access systems
cites work: Hitting and commute times in large graphs are often misleading
cites work: Information-Theoretic Lower Bounds for Distributed Function Computation
DOI: 10.1007/S00446-021-00394-7
description: scientific article; zbMATH DE number 7391591