Searching Unindexed and Nonuniformly Generated Files in $\log \log N$ Time
- 1 November 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (4), 1013-1029
- https://doi.org/10.1137/0214071
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Padded Lists RevisitedSIAM Journal on Computing, 1987
- Storing a sparse table with O(1) worst case access timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Controlled density sortingInformation Processing Letters, 1980
- An algorithmic and complexity analysis of interpolation searchActa Informatica, 1980
- Padded lists: set operations in expected θ(log log N) timeInformation Processing Letters, 1979
- Storing a sparse tableCommunications of the ACM, 1979
- Interpolation search—a log log N searchCommunications of the ACM, 1978
- Understanding the complexity of interpolation searchInformation Processing Letters, 1977
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Preserving order in a forest in less than logarithmic timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975