Pages that link to "Item:Q1898213"
From MaRDI portal
The following pages link to A unified approach to the parallel construction of search trees (Q1898213):
Displaying 11 items.
- An efficient parallel algorithm for building the separating tree (Q666141) (← links)
- Embedding height balanced trees and Fibonacci trees in hypercubes (Q1031992) (← links)
- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree (Q1099627) (← links)
- A unified approach to parallel depth-first traversals of general trees (Q1178197) (← links)
- An optimal parallel algorithm for merging using multiselection (Q1322118) (← links)
- Cost-optimal parallel algorithms for constructing B-trees (Q1894244) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- An architecture independent study of parallel segment trees (Q2465994) (← links)
- A note on generating finer‐grain parallelism in a representation tree (Q4924936) (← links)
- Parallel construction of quadtrees and quality triangulations (Q5060112) (← links)
- Parallel algorithms for red--black trees (Q5958130) (← links)