Further results on digital search trees (Q1110340)

From MaRDI portal
Revision as of 19:24, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Further results on digital search trees
scientific article

    Statements

    Further results on digital search trees (English)
    0 references
    1988
    0 references
    The variance of the internal path length of digital search trees is analysed within a model where we start from certain abstract averaging trees. The asymptotic evaluation is obtained via complex residue calculus.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    asymptotic analysis of generating functions
    0 references
    internal path length
    0 references
    digital search trees
    0 references
    0 references
    0 references
    0 references