Computing inversion pair cardinality through partition-based sorting (Q956693): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4472554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of a Data Structure for Representing Sorted Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting, trees, and measures of order / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to dynamic all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant real-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of Presortedness and Optimal Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sampling Strategies in Quicksort and Quickselect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359741 / rank
 
Normal rank

Latest revision as of 20:15, 28 June 2024

scientific article
Language Label Description Also known as
English
Computing inversion pair cardinality through partition-based sorting
scientific article

    Statements

    Computing inversion pair cardinality through partition-based sorting (English)
    0 references
    0 references
    0 references
    25 November 2008
    0 references
    partition-based sorting
    0 references
    adaptive
    0 references
    measures of disorder
    0 references
    inversion pairs
    0 references
    randomized algorithm
    0 references

    Identifiers