W.K. Luk, Paolo Sipala, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Paper
Parallel Generation of Binary Search Trees
Abstract
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.
Related
K. Steinhöfel, A. Albrecht, et al.
EJOR
Y.F. Wu, P. Widmayer, et al.
Acta Informatica
T.M. Nicholl, D.T. Lee, et al.
BIT