VLSI Sorting with Reduced Hardware
From MaRDI portal
Recommendations
- Optimal VLSI sorting with reduced number of processors
- Optimal VLSI circuits for sorting
- An Architecture for Bitonic Sorting with Optimal VLSI Performnance
- A Minimum Area VLSI Network for O(log n) Time Sorting
- VLSI-sorting evaluated under the linear model
- Parallel sorting in two-dimensional VLSI models of computation
- A VLSI algorithm for sorting variable-length character strings
- scientific article; zbMATH DE number 3898774
Cited in
(12)- A VLSI algorithm for sorting variable-length character strings
- A VLSI partition algorithm
- VLSI-sorting evaluated under the linear model
- Sloping-and-shaking
- A Minimum Area VLSI Network for O(log n) Time Sorting
- An Architecture for Bitonic Sorting with Optimal VLSI Performnance
- scientific article; zbMATH DE number 3898774 (Why is no real title available?)
- Systolic Sorting on a Mesh-Connected Network
- scientific article; zbMATH DE number 3940717 (Why is no real title available?)
- Optimal VLSI circuits for sorting
- scientific article; zbMATH DE number 1852169 (Why is no real title available?)
- Sorting via chip-firing
This page was built for publication: VLSI Sorting with Reduced Hardware
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323283)