Issue No.03 - March (1974 vol.23)
C.K. Wong , Department of Computer Science, University of Illinois
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.
Binary search trees, multiprocessor computer systems, parallel generation, parametrized restructuring.
C.K. Wong, null Shi-Kuo Chang, "Parallel Generation of Binary Search Trees", IEEE Transactions on Computers, vol.23, no. 3, pp. 268-271, March 1974, doi:10.1109/T-C.1974.223921