Tight Comparison Bounds on the Complexity of Parallel Sorting (Q3801082)
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: Tight Comparison Bounds on the Complexity of Parallel Sorting |
scientific article; zbMATH DE number 4068300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Comparison Bounds on the Complexity of Parallel Sorting |
scientific article; zbMATH DE number 4068300 |
Statements
Tight Comparison Bounds on the Complexity of Parallel Sorting (English)
0 references
1987
0 references
parallel computation
0 references
parallel sorting
0 references
bounded parallelism
0 references
AKS network
0 references
sorting network
0 references
lower bounds
0 references
0.8692811727523804
0 references
0.8400776982307434
0 references
0.8340201377868652
0 references
0.8318244814872742
0 references
0.8296954035758972
0 references
