A Comparative Study Of X-Tree, Pyramid And Related Machines
- 1 January 1984
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A Generalized Dictionary Machine for VLSIIEEE Transactions on Computers, 1985
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- On the complexity of vector computations in binary tree machinesInformation Processing Letters, 1981
- New lower bound techniques for VLSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Lower bounds for VLSIPublished by Association for Computing Machinery (ACM) ,1981
- On the Area Required by VLSI CircuitsPublished by Springer Nature ,1981
- The complexity of a VLSI adderInformation Processing Letters, 1980
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- Layered "Recognition Cone" Networks That Preprocess, Classify, and DescribeIEEE Transactions on Computers, 1972