Binary trees with choosable edge lengths (Q989581): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3994535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repeater tree construction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymptotic theory for recurrence relations based on minimization and maximization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum lopsided binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two inequalities implied by unique decipherability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank

Latest revision as of 03:21, 3 July 2024

scientific article
Language Label Description Also known as
English
Binary trees with choosable edge lengths
scientific article

    Statements

    Binary trees with choosable edge lengths (English)
    0 references
    0 references
    0 references
    20 August 2010
    0 references
    0 references
    combinatorial problems
    0 references
    cryptography
    0 references
    binary tree
    0 references
    depth
    0 references
    Kraft's inequality
    0 references
    0 references