Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree (Q1099627)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree |
scientific article |
Statements
Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree (English)
0 references
1986
0 references
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.
0 references
MIMD
0 references
parallel algorithms
0 references
search trees
0 references