Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Performance of data structures for small sets of strings
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Software—Practice & Experience
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal self-adjusting trees for dynamic string data in secondary storage
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
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)
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Cache-Conscious collision resolution in string hash tables
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
A priority queue with the time-finger property
Journal of Discrete Algorithms
| Hi-index | 0.00 |