Ingemar Ingemarsson, C.K. Wong
Information Processing Letters
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.
Ingemar Ingemarsson, C.K. Wong
Information Processing Letters
T. Kloks, D. Kratsch, et al.
Journal of Algorithms
D.T. Lee, C.D. Yang, et al.
Discrete Applied Mathematics
A. Albrecht, S.K. Cheung, et al.
Mathematics and Computers in Simulation