The influence of key length on the area-time complexity of sorting

This publication has 9 references indexed in Scilit:

• Tight Bounds on the Complexity of Parallel Sorting
  IEEE Transactions on Computers, 1985
• Minimum Storage Sorting Networks
  IEEE Transactions on Computers, 1985
• The VLSI optimality of the aks sorting network
  Information Processing Letters, 1985
• An Architecture for Bitonic Sorting with Optimal VLSI Performnance
  IEEE Transactions on Computers, 1984
• A minimum area VLSI network for O(logn) time sorting
  Published by Association for Computing Machinery (ACM) ,1984
• The VLSI Complexity of Sorting
  IEEE Transactions on Computers, 1983
• A Combinatorial Limit to the Computing Power of VLSI Circuits
  IEEE Transactions on Computers, 1983
• The Area-Time Complexity of Binary Multiplication
  Journal of the ACM, 1981
• The complexity of a VLSI adder
  Information Processing Letters, 1980