\(k\)-protected vertices in binary search trees (Q395245): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1304.6105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protected points in ordered 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: 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: The Expected Distribution of Degrees in Random Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic distribution of two-protected nodes in random binary search trees / rank
 
Normal rank

Latest revision as of 06:43, 7 July 2024

scientific article
Language Label Description Also known as
English
\(k\)-protected vertices in binary search trees
scientific article

    Statements

    Identifiers

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