On a sublinear time parallel construction of optimal binary search trees

DOI10.1007/3-540-58338-6_92zbMath1494.68071OpenAlexW1560467792MaRDI QIDQ5096904

Wojciech Rytter, Marek Karpinski

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_92

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• On efficient parallel computations for some dynamic programming problems
• Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
• Optimum binary search trees
• Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition

This page was built for publication: On a sublinear time parallel construction of optimal binary search trees