This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Balancing of Binary Search Trees
April 1974 (vol. 23 no. 4)
pp. 441-444
null Shi-Kuo Chang, IBM T. J. Watson Research Center
A method for the balancing of binary search trees on a highly parallel computer is described. This method can be adapted for execution on a multiprocessor computer system.
Index Terms:
Binary search trees, highly parallel computer, information retrieval, parallel computation, sorting.
Citation:
null Shi-Kuo Chang, "Parallel Balancing of Binary Search Trees," IEEE Transactions on Computers, vol. 23, no. 4, pp. 441-444, April 1974, doi:10.1109/T-C.1974.223959
Usage of this product signifies your acceptance of the Terms of Use.