An optimal parallel adaptive sorting algorithm (Q1182099): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting roughly sorted sequences in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothsort, an alternative for sorting in situ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting partial order with Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new measure of presortedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on adaptive parallel sorting / 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: Q4178501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encroaching lists as a measure of presortedness / rank
 
Normal rank

Latest revision as of 14:37, 15 May 2024

scientific article
Language Label Description Also known as
English
An optimal parallel adaptive sorting algorithm
scientific article

    Statements