Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multiple message broadcasting in the postal model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasting multiple messages in simultaneous send/receive systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing broadcasting algorithms in the postal model for message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal multiple message broadcasting in telephone-like communication systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal computation of census functions in the postal model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence relations based on minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs / 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: Optimum lopsided binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3280457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Elementary Approach to Some Analytic Asymptotics / rank
 
Normal rank

Latest revision as of 20:24, 28 May 2024

scientific article
Language Label Description Also known as
English
Optimal point-to-point broadcast algorithms via lopsided trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references