The influence of key length on the area-time complexity of sorting
- 23 November 2005
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Minimum Storage Sorting NetworksIEEE Transactions on Computers, 1985
- The VLSI optimality of the aks sorting networkInformation Processing Letters, 1985
- An Architecture for Bitonic Sorting with Optimal VLSI PerformnanceIEEE Transactions on Computers, 1984
- A minimum area VLSI network for O(logn) time sortingPublished by Association for Computing Machinery (ACM) ,1984
- The VLSI Complexity of SortingIEEE Transactions on Computers, 1983
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- The complexity of a VLSI adderInformation Processing Letters, 1980