scientific article; zbMATH DE number 871897

MaRDI QIDQ4875166zbMATH OpenFDO

Authors Lawrence L. Larmore, Marek Karpinski, Wojciech Rytter

Publication date 16 June 1996

zbMATH Keywords

binary search treesubquadratic work parallel algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• On a sublinear time parallel construction of optimal binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• Parallel construction of binary trees with near optimal weighted path length
• Assembling approximately optimal binary search trees efficiently using arithmetics

Cited in

(7)

• Cost-optimal parallel algorithms for constructing B-trees
• Parallel construction of binary trees with near optimal weighted path length
• A new genetic approach to construct near-optimal binary search trees
• A subquadratic algorithm for constructing approximately optimal binary search trees
• scientific article; zbMATH DE number 2087827 (Why is no real title available?)
• On a sublinear time parallel construction of optimal binary search trees
• Optimal binary search trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875166)