Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/0304-3975(95)00256-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020033095 / rank
 
Normal rank
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: An optimal parallel adaptive sorting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / 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: Expected time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tour of Chernoff bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothsort's behavior on presorted sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on adaptive parallel sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitsort -- an adaptive sorting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Heapsort / 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: Q4195960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for adaptive sorting / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:42, 27 May 2024

scientific article
Language Label Description Also known as
English
Exploiting few inversions when sorting: Sequential and parallel algorithms
scientific article

    Statements

    Exploiting few inversions when sorting: Sequential and parallel algorithms (English)
    0 references
    0 references
    0 references
    10 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references