C.K. Wong
Proceedings of the American Mathematical Society
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
Jingsheng Cong, Andrew B. Kahng, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
U.I. Gupta, D.T. Lee, et al.
Theoretical Computer Science
Jan-Ming Ho, G. Vijayan, et al.
Integration, the VLSI Journal