On binary search tree recursions with monomials as toll functions (Q1612304): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some asymptotic theory for the bootstrap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Limit Laws for Depths in Random Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting algorithms for broadcast communications: mathematical analysis. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the internal path length ofd-dimensional quad trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary search tree recursions with harmonic toll functions / 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: A fixed point theorem for distributions / 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: Some properties of a limiting distribution in Quicksort / rank
 
Normal rank

Latest revision as of 15:20, 4 June 2024

scientific article
Language Label Description Also known as
English
On binary search tree recursions with monomials as toll functions
scientific article

    Statements

    Identifiers

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