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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1017/apr.2021.42 / rank
Normal rank
 
Property / author
 
Property / author: Q272328 / rank
Normal rank
 
Property / author
 
Property / author: Boris G. Pittel / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / 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
Property / DOI
 
Property / DOI: 10.1017/APR.2021.42 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:52, 30 December 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