A parallel algorithm for optimum height-limited alphabetic binary trees (Q1923383)

From MaRDI portal
Revision as of 18:42, 21 March 2024 by Openalex240321050300 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A parallel algorithm for optimum height-limited alphabetic binary trees
scientific article

    Statements

    A parallel algorithm for optimum height-limited alphabetic binary trees (English)
    0 references
    25 November 1996
    0 references
    optimal alphabetic binary tree
    0 references
    parallel package merge
    0 references
    0 references
    0 references

    Identifiers