Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction can be effected inâ€¦ (More)

We present a global wiring algorithm used in a top-down physical design environment, i.e., macros are laid out after global wiring is done, and wires are allowed to pass through macros (theâ€¦ (More)

The subroutines RDSPMX, ADSPMX, MUSPMX, TRSPMX, M V S P M X , and WRSPMX of ACM Algorithm 408 were tested after conversion to Basic Fortran, and the following corrections appear to be needed: (1) Inâ€¦ (More)

We present an optimal algorithm to determine whether a placement of N isothetic non-overlapping rectangles (macros) can be represented by a slicing tree, and if so, to find a representation ofâ€¦ (More)

In this paper we consider the problem of optimal wiring of VLSI circuits. The topological placement of the circuit elements (macros) on the chip is assumed to have a special hierarchical structure,â€¦ (More)

In this paper, I consider how to implement the basic data structure of LISP programming, the binary tree. I show that, for the compact encoding of LISP trees, three-pointer cells are preferable toâ€¦ (More)

In this paper we discuss a memory allocation problem first introduced by Wolman in [1] (see also [2]). A general solution formula is presented, from which closed form expressions for a few specialâ€¦ (More)

Statistical measurements of the behavior of LISP programs have shown a marked asymmetry in the distribution of their data structures (binary trees). On the basis of a statistical model for such aâ€¦ (More)