On the average height of trees in digital search and dynamic hashing
- 13 November 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (2) , 64-66
- https://doi.org/10.1016/0020-0190(81)90033-8
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A note on the analysis of extendible hashingInformation Processing Letters, 1980
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Dynamic hashingBIT Numerical Mathematics, 1978