Binary search trees with binary comparison cost (Q3335002): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Hans-Werner Six / rank
Normal rank
 
Property / author
 
Property / author: Derick Wood / rank
Normal rank
 
Property / author
 
Property / author: Hans-Werner Six / rank
 
Normal rank
Property / author
 
Property / author: Derick Wood / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for optimalα-β binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stratified balanced search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3933755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3335001 / rank
 
Normal rank

Latest revision as of 13:44, 14 June 2024

scientific article
Language Label Description Also known as
English
Binary search trees with binary comparison cost
scientific article

    Statements

    Binary search trees with binary comparison cost (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    comparison cost
    0 references
    node visit cost
    0 references
    stratified trees
    0 references
    Fibonacci trees
    0 references
    binary search trees
    0 references
    binary trees
    0 references
    balanced search trees
    0 references
    balanced biased trees
    0 references
    height-balanced trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references