Expected complexity of fast search with uniformly distributed data
- 27 October 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 13 (1) , 4-7
- https://doi.org/10.1016/0020-0190(81)90140-x
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A robust variation of interpolation searchInformation Processing Letters, 1980
- Interpolation search—a log log N searchCommunications of the ACM, 1978
- Understanding the complexity of interpolation searchInformation Processing Letters, 1977
- The complexity of searching an ordered random tablePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1976