C.K. Wong, Don Coppersmith
Journal of the ACM
A method of constructing binary search trees in a multiprocessor computer system is proposed. Asymptotically, this method achieves the maximum possible increase in speed as compared with a single processor computer system. To make better use of this method, a parametrized restructuring of binary search trees is also discussed. Copyright © 1974 by The Institute of Electrical and Electronics Engineers, Inc.
C.K. Wong, Don Coppersmith
Journal of the ACM
P. Widmayer, C.K. Wong
Information Processing Letters
K.M. Chung, F. Luccio, et al.
Information Processing Letters
Xiaoyun Lu, Da-Wei Wang, et al.
Discrete Mathematics