New trie data structures which support very fast search operations
- 1 June 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 28 (3) , 379-394
- https://doi.org/10.1016/0022-0000(84)90020-5
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- A priority queue in which initialization and queue operations takeO(loglogD) timeTheory of Computing Systems, 1981
- 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
- Design and implementation of an efficient priority queueTheory of Computing Systems, 1976
- Big Omicron and big Omega and big ThetaACM SIGACT News, 1976
- The Art of Computer Programming, Vol. 3: Sorting and SearchingMathematics of Computation, 1974
- Trie memoryCommunications of the ACM, 1960