Engineering parallel string sorting (Q513306): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-015-0071-1 / rank
Normal rank
 
Property / author
 
Property / author: Peter Sanders / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GitHub / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quicksort / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MCSTL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1574212840 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1403.2056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel String Sample Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Samplesort: A Sampling Approach to Minimal Storage Tree Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel string algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On demand string sorting over unbounded alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scanning multiple sequences via cache memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast priority queues for cached memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parallel Sorting Scheme by Order Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering burstsort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-conscious sorting of large sets of strings with dynamic tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cache-efficient string sorting using copying / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-015-0071-1 / rank
 
Normal rank

Latest revision as of 20:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Engineering parallel string sorting
scientific article

    Statements

    Engineering parallel string sorting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 March 2017
    0 references
    parallel string sorting
    0 references
    string sorting
    0 references
    sample sort
    0 references
    merge sort
    0 references
    LCP-merge sort
    0 references
    LCP-insertion sort
    0 references
    super scalar string sample sort
    0 references
    0 references
    0 references
    0 references

    Identifiers

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