Selected papers that cite this one
- Marek Karpinski, Lawrence L. Larmore, and Wojciech Rytter. Correctness of constructing optimal alphabetic trees revisited. Theoretical Computer Science, 180(1-2):309-324, 10 June 1997.
- Lawrence L. Larmore and Teresa M. Przytycka. A parallel algorithm for optimum height-limited alphabetic binary trees. Journal of Parallel and Distributed Computing, 35(1):49-56, 25 May 1996.
- Lawrence L. Larmore and Teresa M. Przytycka. A fast algorithm for optimum height-limited alphabetic binary trees. SIAM Journal on Computing, 23(6):1283-1312, December 1994.
- S. V. Nagaraj. Optimal binary search trees. Theoretical Computer Science, 188(1-2):1-44, 30 November 1997. Tutorial.