The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Parallel Sorting Algorithms
Introduction to VLSI Systems
How to assemble tree machines (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Bounds on minimax edge length for complete binary trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Optimal tree layout (Preliminary Version)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The tree machine: a highly concurrent computing environment
The tree machine: a highly concurrent computing environment
A complexity theory for VLSI
Computational Aspects of VLSI
| Hi-index | 14.98 |
A modified tree architecture called the compressed tree machine is proposed, and it is shown the compressed tree machine can be an alternative to the conventional tree machine.