Parallel Balancing of Binary Search Trees

Authors:
Shi-Kuo Chang
Affiliations:
IBM T. J. Watson Research Center
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 2
Cited 0

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)
The Computation of Window Operations on a Parallel Organized Computer A Case Study

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.