The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1974 vol.23)
pp: 441-444
null Shi-Kuo Chang , IBM T. J. Watson Research Center
ABSTRACT
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
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool