A Maximally Parallel Balancing Algorithm for Obtaining Complete Balanced Binary Trees
From MaRDI portal
Publication:3681949
DOI10.1109/TC.1985.5009411zbMath0566.68058MaRDI QIDQ3681949
Abha Moitra, S. Sitharama Iyengar
Publication date: 1985
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1985.5009411
05C05: Trees
68P10: Searching and sorting
68R10: Graph theory (including graph drawing) in computer science
Related Items
Optimal binary search trees, Parallel algorithms for red--black trees, Optimal parallel quicksort on EREW PRAM, On constructing multiple spanning trees in a hypercube, Cost-optimal parallel algorithms for constructing B-trees