Journal of the ACM Bibliography
William H. Burge. An analysis of
binary search trees formed from sequences of nondistinct keys.
Journal of the ACM, 23(3):451-454, July 1976.
[BibTeX entry]
Selected papers that cite this one
- Julien Clément, Philippe Flajolet, and Brigitte Vallée. The analysis of
hybrid tie structures. In Proceedings of the Ninth Annual
ACM-SIAM Symposium on Discrete Algorithms, pages 531-539, San
Francisco, California, 25-27 January 1998.
- Rainer Kemp. Binary
search trees constructed from nondistinct keys with/without specified
probabilities. Theoretical Computer Science,
156(1-2):39-70, 25 March 1996.
- S. V. Nagaraj. Optimal binary search
trees. Theoretical Computer Science, 188(1-2):1-44, 30
November 1997. Tutorial.
Shortcuts: