Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms (Q4729356)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4729356 |
scientific article; zbMATH DE number 4114015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8712216019630432
0 references
0.8626363277435303
0 references
