The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Hashing and trie algorithms for partial match retrieval
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Tree Structures for Optimal Searching
Journal of the ACM (JACM)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Design of tree structures for efficient querying
Communications of the ACM
Variable length tree structures having minimum average search time
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Variable-depth trie index optimization: theory and experimental results
ACM Transactions on Database Systems (TODS)
A compendium of key search references
ACM SIGIR Forum
Analysis of a heuristic for full trie minimization
ACM Transactions on Database Systems (TODS)
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |