The VLSI Complexity of Sorting (Q3036700): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/tc.1983.1676178 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134845208 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The VLSI Complexity of Sorting |
scientific article |
Statements
The VLSI Complexity of Sorting (English)
0 references
1983
0 references
area-time complexity
0 references
bitonic sort
0 references
bubble sort
0 references
mesh-connected computers
0 references
parallel algorithms
0 references
sorting
0 references
VLSI
0 references
heapsort
0 references
shuffle exchange network
0 references
