Issue No. 04 - April (1974 vol. 23)
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.
Binary search trees, highly parallel computer, information retrieval, parallel computation, sorting.
n. Shi-Kuo Chang, "Parallel Balancing of Binary Search Trees," in IEEE Transactions on Computers, vol. 23, no. , pp. 441-444, 1974.