Tight Comparison Bounds on the Complexity of Parallel Sorting (Q3801082)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tight Comparison Bounds on the Complexity of Parallel Sorting |
scientific article |
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