On implementing large binary tree architectures in VLSI and WSI
- 1 April 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (4) , 526-537
- https://doi.org/10.1109/12.21145
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Efficient Embeddings of Binary Trees in VLSI ArraysIEEE Transactions on Computers, 1987
- Embedding Tree Structures in VLSI Hexagonal ArraysIEEE Transactions on Computers, 1984
- The trials of wafer-scale integration: Although major technical problems have been overcome since WSI was first tried in the 1960s, commercial companies can't yet make it flyIEEE Spectrum, 1984
- A VLSI tree machine for relational data basesPublished by Association for Computing Machinery (ACM) ,1983
- A Dictionary Machine (for VLSI)IEEE Transactions on Computers, 1982
- Introduction to the configurable, highly parallel computerComputer, 1982
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981
- A model of computation for VLSI with related complexity resultsPublished by Association for Computing Machinery (ACM) ,1981
- Bounds on minimax edge length for complete binary treesPublished by Association for Computing Machinery (ACM) ,1981
- On the area of binary tree layoutsInformation Processing Letters, 1980