Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
We present parallel algorithms for constructing and maintaining balanced m-way search trees. These parallel algorithms have time complexity O(1) for an n processors configuration. The formal correctness of the algorithms is given in detail.
scientific article; zbMATH DE number 4041285
scientific article