Lower bounds on systolic gossip
type: Item
instance of: scholarly article
title: Lower bounds on systolic gossip
zbMATH Open document ID: 1105.68006
author: Michele Flammini
author: Stéphane Pérennes
published in: Information and Computation
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 2136297
zbMATH Keywords: gossiping
zbMATH Keywords: systolic protocols
MaRDI profile type: Publication
full work available at URL: j.ic.2004.09.002
OpenAlex ID: W2024775689
cites work: Q4326384
cites work: Broadcasting in Bounded Degree Graphs
cites work: On the optimality of general lower bounds for broadcasting and gossiping
cites work: Methods and problems of communication in usual networks
cites work: A survey of gossiping and broadcasting in communication networks
cites work: The complexity of systolic dissemination of information in interconnection networks
cites work: Q4870160
cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
cites work: Effective systolic algorithms for gossiping in cycles and two-dimensional grids
cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes
cites work: Broadcasting in butterfly and deBruijn networks
cites work: Traffic-light scheduling on the grid
cites work: Gossiping in Minimal Time
cites work: Q3972008
cites work: Periodic gossiping on trees
cites work: Q4002466
cites work: Broadcast Networks of Bounded Degree
cites work: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
cites work: Fast information sharing in a complete network
DOI: 10.1016/J.IC.2004.09.002
description: scientific article; zbMATH DE number 2136297