On a sublinear time parallel construction of optimal binary search trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 871897
- A unified approach to the parallel construction of search trees
- A subquadratic algorithm for constructing approximately optimal binary search trees
- scientific article; zbMATH DE number 2087827
- Building Optimal Binary Search Trees from Sorted Values in O(N) Time
Cites work
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- On efficient parallel computations for some dynamic programming problems
- Optimum binary search trees
- Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
Cited in
(9)- Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree
- On batch-constructing B\(^{+}\)-trees: Algorithm and its performance evaluation
- A unified approach to the parallel construction of search trees
- Parallel construction of binary trees with near optimal weighted path length
- Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory
- A subquadratic algorithm for constructing approximately optimal binary search trees
- scientific article; zbMATH DE number 2087827 (Why is no real title available?)
- scientific article; zbMATH DE number 871897 (Why is no real title available?)
- Building Optimal Binary Search Trees from Sorted Values in O(N) Time
This page was built for publication: On a sublinear time parallel construction of optimal binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096904)
