Journal of the ACM Bibliography

Selected papers that cite this one

• H. Lynn Beus. The use of information in sorting. Journal of the ACM, 17(3):482-495, July 1970.

• P. Flajolet, J. Fran\v{c}on, and J. Vuillemin. Sequence of operations analysis for dynamic data structures. Journal of Algorithms, 1(2):111-141, June 1980.

• W. D. Frazer and A. C. McKellar. Samplesort: A sampling approach to minimal storage tree sorting. Journal of the ACM, 17(3):496-507, July 1970.

• Thomas N. Hibbard. A simple sorting algorithm. Journal of the ACM, 10(2):142-150, April 1963.

• Conrado Martínez and Salvador Roura. Randomized binary search trees. Journal of the ACM, 45(2):288-323, March 1998.

• S. V. Nagaraj. Optimal binary search trees. Theoretical Computer Science, 188(1-2):1-44, 30 November 1997. Tutorial.

• J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing, 2(1):33-43, March 1973.

• J. Nievergelt and C. K. Wong. Upper bounds for the total path length of binary trees. Journal of the ACM, 20(1):1-6, January 1973.

• E. M. Palmer, M. A. Rahimi, and R. W. Robinson. Efficiency of a binary comparison storage technique. Journal of the ACM, 21(3):376-384, July 1974.

Selected references

• W. H. Burge. Sorting, trees, and measures of order. Information and Control, 1(3):181-197, September 1958.

• Paul Hildebrandt and Harold Isbitz. Radix exchange -- an internal sorting method for digital computers. Journal of the ACM, 6(2):156-163, April 1959.

Shortcuts: