Running time of the treapsort algorithm (Q387004): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Michel Schellekens / rank
Normal rank
 
Property / author
 
Property / author: Michel Schellekens / 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.1016/j.tcs.2013.03.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977694409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4524568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limiting distribution for quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3421283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of a limiting distribution in Quicksort / rank
 
Normal rank

Latest revision as of 04:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Running time of the treapsort algorithm
scientific article

    Statements

    Running time of the treapsort algorithm (English)
    0 references
    0 references
    0 references
    11 December 2013
    0 references
    average-case analysis of algorithms
    0 references
    smoothed complexity
    0 references
    sorting algorithms
    0 references
    \(\mathcal{MOQA}\)
    0 references

    Identifiers