A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240)

From MaRDI portal
Revision as of 23:29, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A subquadratic algorithm for constructing approximately optimal binary search trees
scientific article

    Statements

    A subquadratic algorithm for constructing approximately optimal binary search trees (English)
    0 references
    1987
    0 references
    optimal binary search trees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references