Almost-optimal gossip-based aggregate computation
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.68027
DOI: 10.1137/100793104
author: Jen-Yeu Chen
author: Gopal Pandurangan
published in: SIAM Journal on Computing
publication date: 2012-09-12T00:00:00Z
full work available at URL: http://hdl.handle.net/10220/10895
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 6081202
zbMATH Keywords: gossip-based protocol
zbMATH Keywords: aggregate functions
zbMATH Keywords: aggregate computation
zbMATH Keywords: message complexity
zbMATH Keywords: time complexity
zbMATH Keywords: peer-to-peer networks
zbMATH Keywords: sparse communication networks
zbMATH Keywords: distribution random ranking
zbMATH Keywords: address-oblivious algorithm
zbMATH Keywords: non-address-oblivious algorithm
MaRDI profile type: Publication
OpenAlex ID: W2063513700
Recommended article: Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
Recommended article: Efficient gossip and robust distributed computation
Recommended article: Distributed Computing
Recommended article: Robust Gossip-Based Aggregation: A Practical Point of View
Recommended article: Q4457548
Recommended article: Gossip consensus algorithms via quantized communication
Recommended article: A Polylogarithmic Gossip Algorithm for Plurality Consensus
Recommended article: Optimal algorithms for broadcast and gossip in the edge-disjoint modes
title: Almost-optimal gossip-based aggregate computation
description: scientific article; zbMATH DE number 6081202