The height of a binary search tree: the limiting distribution perspective. (Q1853551): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Q4222737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential-difference equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the height of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching processes in the analysis of the heights of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Variance of the Height of Random Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytic approach to the height of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularity Analysis of Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5843703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508387 / 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: Singular Perturbation Analysis of Boundary Value Problems for Differential-Difference Equations. V. Small Shifts with Layer Behavior / 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: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On growing random binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How tall is a tree? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special issue: Average-case analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993278 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:28, 5 June 2024

scientific article
Language Label Description Also known as
English
The height of a binary search tree: the limiting distribution perspective.
scientific article

    Statements

    The height of a binary search tree: the limiting distribution perspective. (English)
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    Binary search trees
    0 references
    Limiting height distribution
    0 references
    Saddle point method
    0 references
    Matched asymptotics
    0 references
    Linearization
    0 references
    WKB method
    0 references
    Nonlinear integral equation
    0 references

    Identifiers