A Framework for Solving VLSI (Very Large Scale Integration) Graph Layout Problems. (1998)
This paper introduces a new divide- and conquer framework for VLSI graph layout. Universally close upper and lower bounds are obtained for important cost functions such as layout area and propagation...
How to Assemble Tree Machines. (1998)
Many researchers have proposed that ensembles of processing elements be organized as trees. This paper explores how large tree machines can be assembled efficiently from smaller components. A...