One-sided variations on binary search trees (Q1881001): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Randomized binary search technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the theory of records in the study of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variance of the height of binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution for the duration of a randomized leader election algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-sided variations on interval trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of distances in random binary search trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of descendants and ascendants in random search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting down random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multivariate contraction method for random recursive structures with applications to Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the contraction method with degenerate limit equation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to select a loser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability metrics and recursive algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for “quicksort” / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of stochastic divide and conquer algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The contraction method for recursive algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sequential bisection and its associated binary tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces / rank
 
Normal rank

Latest revision as of 20:09, 6 June 2024

scientific article
Language Label Description Also known as
English
One-sided variations on binary search trees
scientific article

    Statements

    One-sided variations on binary search trees (English)
    0 references
    0 references
    27 September 2004
    0 references
    Random tree
    0 references
    limit distribution
    0 references
    recurrence equation
    0 references
    contraction
    0 references
    degenerate limit
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references