Area-time tradeoffs for selection
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 163-168
- https://doi.org/10.1007/3-540-18099-0_42
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The influence of key length on the area-time complexity of sortingPublished by Springer Nature ,2005
- On The Area-Time Optimal Design Of l-selectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A minimum-area circuit forl-selectionAlgorithmica, 1987
- Area-time lower-bound techniques with applications to sortingAlgorithmica, 1986
- Aspects of information flow in VLSI circuitsPublished by Association for Computing Machinery (ACM) ,1986
- Tight bounds on the complexity of parallel sortingPublished by Association for Computing Machinery (ACM) ,1984
- Lower bounds for VLSIPublished by Association for Computing Machinery (ACM) ,1981
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979