Jan Ming Ho, Majid Sarrafzadeh, 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
D.T. Lee, C.D. Yang, et al.
International Journal of Computational Geometry and Applications
Yuh-Zen Liao, C.K. Wong
IEEE TCADIS
G.Y. Yan, J.F. Pan, et al.
Graphs and Combinatorics