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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q515810
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Boris G. Pittel / 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.1017/apr.2021.42 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4282023542 / rank
 
Normal rank

Latest revision as of 02:49, 20 March 2024

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

    Statements

    On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM (English)
    0 references
    0 references
    0 references
    28 June 2022
    0 references
    root
    0 references
    rank
    0 references
    distance
    0 references
    distribution
    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