The VLSI Complexity of Sorting
- 1 January 1981
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- The complexity of a VLSI adderInformation Processing Letters, 1980
- Area-time optimal VLSI networks for multiplying matricesInformation Processing Letters, 1980
- Scaling I/sup 2/L for VLSIIEEE Journal of Solid-State Circuits, 1979