scientific article; zbMATH DE number 871897

zbMATH Open0852.68035MaRDI QIDQ4875166FDOQ4875166

Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter

Publication date: 16 June 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

binary search treesubquadratic work parallel algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• A subquadratic algorithm for constructing approximately optimal binary search trees
• Cost-optimal parallel algorithms for constructing B-trees
• Parallel construction of binary trees with near optimal weighted path length
• Optimal binary search trees
• A new genetic approach to construct near-optimal binary search trees
• Title not available (Why is that?)

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)