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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00269807 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043823800 / rank
 
Normal rank

Latest revision as of 10:48, 30 July 2024

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

    Statements

    Identifiers