Tight Bounds on the Complexity of Parallel Sorting (Q3219774)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight Bounds on the Complexity of Parallel Sorting |
scientific article |
Statements
Tight Bounds on the Complexity of Parallel Sorting (English)
0 references
1985
0 references
parallel sorting
0 references
area-time tradeoffs
0 references
circuit complexity
0 references
communication complexity
0 references
packet routing
0 references
parallel computation
0 references
VLSI
0 references
bounded-degree fixed-connection network
0 references
