Lower bounds on systolic gossip (Q1763428)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Lower bounds on systolic gossip	scientific article

Statements

scholarly article

Lower bounds on systolic gossip (English)

Michele Flammini

Stéphane Pérennes

Information and Computation

publication date

22 February 2005

zbMATH Keywords

gossiping

systolic protocols

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ic.2004.09.002

Broadcasting in Bounded Degree Graphs

On the Optimality of General Lower Bounds for Broadcasting and Gossiping

Methods and problems of communication in usual networks

A survey of gossiping and broadcasting in communication networks

The complexity of systolic dissemination of information in interconnection networks

Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs

Effective systolic algorithms for gossiping in cycles and two-dimensional grids

Optimal algorithms for broadcast and gossip in the edge-disjoint modes

Broadcasting in butterfly and deBruijn networks

Traffic-light scheduling on the grid

Gossiping in Minimal Time

Periodic gossiping on trees

Broadcast Networks of Bounded Degree

Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks

Fast information sharing in a complete network

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.IC.2004.09.002

Sitelinks

Mathematics(1 entry)

mardi Publication:1763428

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1763428&oldid=38735714"