The on-line d-dimensional dictionary problem
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Modified List Technique Allowing Binary Search
Journal of the ACM (JACM)
All searches are divided into three parts: string searches using ternary trees
APL '98 Proceedings of the APL98 conference on Array processing language
ACM Computing Surveys (CSUR)
Identifier Search Mechanisms: A Survey and Generalized Model
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Randomized binary search technique
Communications of the ACM
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Hybrid trees: A data structure for lists of keys
SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control
An analysis of the height of tries with random weights on the edges
Combinatorics, Probability and Computing
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
| Hi-index | 48.23 |
A more efficient method of using tree structures is proposed, which utilizes both plus and minus branches in the search path. Very significant gains result when the search key includes alphabetic characters.