Tight Bounds on the Complexity of Parallel Sorting (Q3219774)
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 3887082
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight Bounds on the Complexity of Parallel Sorting |
scientific article; zbMATH DE number 3887082 |
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
0.9877839
0 references
0.9579351
0 references
0 references
0.92968994
0 references
0.9290644
0 references
0.9247126
0 references
0.91815555
0 references
0.9110618
0 references
0.9090101
0 references
0 references
