Hierarchical global wiring for custom chip design
W.K. Luk, D.T. Tang, et al.
DAC 1986
Given a file of N records each of which has k keys, the worst-case analysis for the region and partial region queries in multidimensional binary search trees and balanced quad trees are presented. It is shown that the search algorithms proposed in [1, 3] run in time O(k·N1-1/k) for region queries in both tree structures. For partial region queries with s keys specified, the search algorithms run at most in time O(s·N1-1/k) in both structures. © 1977 Springer-Verlag.
W.K. Luk, D.T. Tang, et al.
DAC 1986
Jin-Fuw Lee, D.T. Tang, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Jan-Ming Ho, Majid Sarrafzadeh, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
T.M. Nicholl, D.T. Lee, et al.
BIT