Lower bounds on systolic gossip (Q1763428): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2004.09.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024775689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Optimality of General Lower Bounds for Broadcasting and Gossiping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods and problems of communication in usual networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of systolic dissemination of information in interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective systolic algorithms for gossiping in cycles and two-dimensional grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for broadcast and gossip in the edge-disjoint modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting in butterfly and deBruijn networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic-light scheduling on the grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gossiping in Minimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic gossiping on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcast Networks of Bounded Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast information sharing in a complete network / rank
 
Normal rank

Latest revision as of 18:23, 7 June 2024

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

    Statements

    Lower bounds on systolic gossip (English)
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    0 references
    gossiping
    0 references
    systolic protocols
    0 references
    0 references