This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Generation of Binary Search Trees
March 1974 (vol. 23 no. 3)
pp. 268-271
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.
Index Terms:
Binary search trees, multiprocessor computer systems, parallel generation, parametrized restructuring.
Citation:
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
Usage of this product signifies your acceptance of the Terms of Use.