Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees

Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter. Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. In SODA. pages 36-41, 1996.

Abstract

Abstract is missing.