A Minimum Area VLSI Network for O(log n) Time Sorting (Q3219772)
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: A Minimum Area VLSI Network for O(log n) Time Sorting |
scientific article; zbMATH DE number 3887080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Minimum Area VLSI Network for O(log n) Time Sorting |
scientific article; zbMATH DE number 3887080 |
Statements
A Minimum Area VLSI Network for O(log n) Time Sorting (English)
0 references
1985
0 references
bitonic merging
0 references
combination sorting
0 references
optimal algorithms
0 references
parallel computation
0 references
parallel sorting algorithms
0 references
VLSI implementation
0 references
area-time performance
0 references
hybrid architecture
0 references
orthogonal trees
0 references
cube-connected cycles
0 references
0.8759122490882874
0 references
0.8502851128578186
0 references
0.8454906344413757
0 references
0.8421351313591003
0 references
