Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree (Q1099627)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree |
scientific article; zbMATH DE number 4041285
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree |
scientific article; zbMATH DE number 4041285 |
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
0.9191102
0 references
0.91569376
0 references
0.90811884
0 references
0.90811884
0 references
0.90730816
0 references
0.90433633
0 references
0.9041525
0 references
