Area-time lower-bound techniques with applications to sorting
- 1 November 1986
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4) , 65-91
- https://doi.org/10.1007/bf01840437
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The influence of key length on the area-time complexity of sortingPublished by Springer Nature ,2005
- The VLSI optimality of the aks sorting networkInformation Processing Letters, 1985
- The VLSI Complexity of Selected Graph ProblemsJournal of the ACM, 1984
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- The VLSI Complexity of SortingIEEE Transactions on Computers, 1983
- Optimal allocation of computational resources in VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- 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
- On the Area Required by VLSI CircuitsPublished by Springer Nature ,1981
- The complexity of a VLSI adderInformation Processing Letters, 1980