On a random search tree: asymptotic enumeration of vertices by distance from leaves (Q5233192): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Asymptotic fringe distributions for general families of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-protected vertices in binary search trees / 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: Limit laws for local counters in random binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protected nodes and fringe subtrees in some random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on protected nodes in digital search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-protected nodes in random digital trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic distribution of two-protected nodes in ternary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moment of degeneration of a branching process and height of a random tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Most Probable Shape of a Search Tree Grown from a Random Permutation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic distribution of two-protected nodes in random binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Properties of Protected Nodes in Random Recursive Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On growing random binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the heights of random recursive trees and random <i>m</i>‐ary search trees / rank
 
Normal rank

Latest revision as of 10:38, 20 July 2024

scientific article; zbMATH DE number 7105422
Language Label Description Also known as
English
On a random search tree: asymptotic enumeration of vertices by distance from leaves
scientific article; zbMATH DE number 7105422

    Statements

    On a random search tree: asymptotic enumeration of vertices by distance from leaves (English)
    0 references
    0 references
    0 references
    16 September 2019
    0 references
    search tree
    0 references
    root
    0 references
    leaves
    0 references
    rank
    0 references
    enumeration
    0 references
    asymptotic
    0 references
    distribution
    0 references
    numerical data
    0 references

    Identifiers

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