On the Average Height of Trees in Digital Search and Dynamic Hashing

[1]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[2]  Per-Åke Larson,et al.  Dynamic hashing , 1978, BIT.

[3]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[4]  John Michael Robson,et al.  The Height of Binary Search Trees , 1979, Aust. Comput. J..

[5]  Philippe Flajolet,et al.  Exploring binary trees and other simple trees , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[6]  Andrew Chi-Chih Yao,et al.  A Note on the Analysis of Extendible Hashing , 1980, Inf. Process. Lett..