Conference paper
Wiring and crosstalk avoidance in multi-chip module design
Howard H. Chen, C.K. Wong
CICC 1992
The definition of binary split trees is generalized by removing the condition of decreasing frequency. It is shown that the access time of generalized split trees is less than that of split trees in general. The optimal representation of generalized split trees is studied. A polynomial time algorithm to construct such optimal tree structures is given. The relationship among several classes of binary trees are also discussed. © 1984 Springer-Verlag.
Howard H. Chen, C.K. Wong
CICC 1992
Ashok K. Chandra, C.K. Wong
IEEE TC
Jin-Fuw Lee, D.T. Tang, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Charles Chiang, Majid Sarrafzadeh, et al.
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications