Constructing sorting networks from k-sorters (Q582119): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q38772864, #quickstatements; #temporary_batch_1711234560214 |
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: Improved Divide/Sort/Merge Sorting Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tight Bounds on the Complexity of Parallel Sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallel sorting scheme whose basic operation sortsN elements / rank | |||
Normal rank |
Latest revision as of 12:12, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing sorting networks from k-sorters |
scientific article |
Statements
Constructing sorting networks from k-sorters (English)
0 references
1989
0 references
parallel processing
0 references
analysis of algorithms
0 references
merging networks
0 references