The expected profile of digital search trees (Q549244): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/j.jcta.2011.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2117773253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of trie-like structures under the density model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Width and mode of the profile for some random trees of logarithmic height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mellin transforms and asymptotics: Harmonic sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical depoissonization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average profile of the Lempel-Ziv parsing scheme for a Markovian source / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel--Ziv Scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on growing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and asymptotic distributions in digital and binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Profiles of Tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotical growth of a class of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in a random digital tree: limiting distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of digital search trees from the successful search viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Average-case analysis of algorithms / rank
 
Normal rank

Latest revision as of 06:57, 4 July 2024

scientific article
Language Label Description Also known as
English
The expected profile of digital search trees
scientific article

    Statements

    The expected profile of digital search trees (English)
    0 references
    0 references
    0 references
    7 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    digital search trees
    0 references
    tree profiles
    0 references
    analytic combinatorics
    0 references
    analysis of algorithms
    0 references
    recurrences
    0 references
    generating functions
    0 references
    poissonization
    0 references
    Mellin transform
    0 references
    saddle point method
    0 references
    0 references