Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (Q4729356): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Algorithm 447 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023518480 / rank | |||
Normal rank | |||
Latest revision as of 23:03, 19 March 2024
scientific article; zbMATH DE number 4114015
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms |
scientific article; zbMATH DE number 4114015 |
Statements
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (English)
0 references
1989
0 references
randomized parallel sorting algorithms
0 references
random permutations
0 references
radix sort
0 references
optimal algorithms
0 references
parallel RAM
0 references
prefix sum
0 references
