Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree

@article{Dekel1986OptimalPA,
  title={Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree},
  author={Eliezer Dekel and Shietung Peng and S. Sitharma Lyengar},
  journal={International Journal of Parallel Programming},
  year={1986},
  volume={15},
  pages={503-528}
}
We present parallel algorithms for constructing and maintaining balancedm-way search trees. These parallel algorithms have time complexity O(1) for ann processors configuration. The formal correctness of the algorithms is given in detail.