An optimal parallel algorithm for sorting multisets (Q293338): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallel Merge Sort / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Faster optimal parallel prefix sums and list ranking / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal parallel randomized renaming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3361878 / rank | |||
Normal rank | |||
Latest revision as of 03:38, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal parallel algorithm for sorting multisets |
scientific article |
Statements
An optimal parallel algorithm for sorting multisets (English)
0 references
9 June 2016
0 references
multiset sorting
0 references
randomized algorithms
0 references
arbitrary CRCW PRAM
0 references
computational complexity
0 references
