The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms (Q3815534)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4087034
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms |
scientific article; zbMATH DE number 4087034 |
Statements
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms (English)
0 references
1988
0 references
parallel sorting
0 references
comparison algorithms
0 references
randomized sorting
0 references
0.8724878430366516
0 references
0.84512859582901
0 references
0.8318244814872742
0 references
0.8029493689537048
0 references
0.8022656440734863
0 references
