Binary search trees in secondary memory (Q1146005): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of AVL trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of height-balanced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Bound for The Weighted Path Length of Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Search Trees of Bounded Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds for the Total Path Length of Binary Trees / rank
 
Normal rank

Revision as of 09:44, 13 June 2024

scientific article
Language Label Description Also known as
English
Binary search trees in secondary memory
scientific article

    Statements

    Binary search trees in secondary memory (English)
    0 references
    0 references
    1981
    0 references
    binary search trees
    0 references
    secondary memory
    0 references
    AVL trees
    0 references
    AVL algorithm
    0 references

    Identifiers