An Architecture for Bitonic Sorting with Optimal VLSI Performnance (Q3323284)
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 3854435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Architecture for Bitonic Sorting with Optimal VLSI Performnance |
scientific article; zbMATH DE number 3854435 |
Statements
An Architecture for Bitonic Sorting with Optimal VLSI Performnance (English)
0 references
1984
0 references
area-time tradeoff
0 references
optimal algorithms
0 references
parallel computation
0 references
VLSI complexity
0 references
interconnection network
0 references
pleated cube-connected cycles
0 references
stable bitonic sorting
0 references
0.8421351313591003
0 references
0.8060393333435059
0 references
0.8032909631729126
0 references
0.7973266839981079
0 references
0.7773571014404297
0 references
