Q4429298 (Q4429298): Difference between revisions

From MaRDI portal
← Older edit
Import240304020342 (talk | contribs)
4,416,906 edits
Set profile property.
ReferenceBot (talk | contribs)
Bots
1,196,834 edits
‎Changed an Item
 
Property / cites work
 
Property / cites work: Minimum-time line broadcast networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for dissemination of information in generalized communication modes / 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: 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: Optimal algorithms for broadcast and gossip in the edge-disjoint modes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks / rank
 
Normal rank

Latest revision as of 11:23, 6 June 2024

scientific article; zbMATH DE number 1985614
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 1985614

    Statements

    publication date
    25 September 2003
    0 references
    Mathematics Subject Classification ID
    90B18
    0 references
    68W15
    0 references
    68M10
    0 references
    zbMATH DE Number
    1985614
    0 references
    zbMATH Keywords
    communication algorithms
    0 references
    parallel computations
    0 references
    broadcast complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4429298&oldid=34350262"
    Powered by MediaWiki