Further results on digital search trees (Q1110340): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter Kirschenhofer / rank
 
Normal rank
Property / author
 
Property / author: Prodinger, Helmut / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Peter Kirschenhofer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(88)90023-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985558449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Search Trees Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3774964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on V-ary asymmetric tries / rank
 
Normal rank

Latest revision as of 18:24, 18 June 2024

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
    asymptotic analysis of generating functions
    0 references
    internal path length
    0 references
    digital search trees
    0 references
    0 references
    0 references

    Identifiers

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