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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964000676 / rank
 
Normal rank

Revision as of 22:27, 19 March 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