Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (Q4729356): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q61772707, #quickstatements; #temporary_batch_1706298923732 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61772707 / rank | |||
Normal rank | |||
Revision as of 21:06, 26 January 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
