On problem transformability in VLSI
Open Access
- 1 November 1987
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 2 (1-4), 97-111
- https://doi.org/10.1007/bf01840352
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 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 chip area lower bounds for discrete Fourier and Walsh-Hadamard transformationsInformation Processing Letters, 1985
- Minimum Storage Sorting NetworksIEEE Transactions on Computers, 1985
- Computational GeometryPublished by Springer Nature ,1985
- Tight bounds on the complexity of parallel sortingPublished by Association for Computing Machinery (ACM) ,1984
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- Parallel Scheduling AlgorithmsOperations Research, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980