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.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.