The VLSI Complexity of Sorting
Author:
- 1 January 1981
- book chapter
- Published by Springer Nature
- p. 108-118
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Area—time tradeoffs for matrix multiplication and related problems in VLSI modelsJournal of Computer and System Sciences, 1981
- Planar Circuit Complexity and The Performance of VLSI Algorithms +1981
- Replication of Inputs May Save Computational Resources in VLSI1981
- The complexity of a VLSI adderInformation Processing Letters, 1980
- Area-time optimal VLSI networks for multiplying matricesInformation Processing Letters, 1980
- Fully Interconnecting Multiple Computers with Pipelined Sorting NetsIEEE Transactions on Computers, 1979
- Very Fast Fourier Transform Algorithms Hardware for ImplementationIEEE Transactions on Computers, 1979
- Scaling I/sup 2/L for VLSIIEEE Journal of Solid-State Circuits, 1979
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971