Author:
Gaither Jeffrey,Mahmoud Hosam,Ward Mark Daniel
Funder
Directorate for Mathematical and Physical Sciences
Directorate for Computer and Information Science and Engineering
Publisher
Springer Science and Business Media LLC
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference24 articles.
1. De La Briandais, R.: File searching using variable length keys. In: Proceedings of the Western Joint Computer Conference, pp. 295–298. AFIPS, San Francisco, California (1959)
2. Dobrow, R., Fill, J.: Multiway trees of maximum and minimum probability under the random permutation model. Comb. Probab. Comput. 5, 351–371 (1996)
3. Fagin, R., Nievergelt, J., Pippenger, N., Strong, H.: Extendible hashing—a fast access method for dynamic files. ACM Trans. Database Syst. 4, 315–344 (1979)
4. Feng, Q., Mahmoud, H.: On the variety of shapes on the fringe of a random recursive tree. J. Appl. Probab. 47, 191–200 (2008)
5. Fill, J.: On the distribution of binary search trees under the random permutation model. Random Struct. Algorithms 8, 1–25 (1996)