Log-logarithmic worst-case range queries are possible in space Θ(N)
- 24 August 1983
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 17 (2) , 81-84
- https://doi.org/10.1016/0020-0190(83)90075-3
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Storing a sparse table with O(1) worst case access timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- An algorithmic and complexity analysis of interpolation searchActa Informatica, 1980
- 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
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976