2 search results - page 1 / 1 » HAT-Trie: A Cache-Conscious Trie-Based Data Structure For St... |
ACSC
2007
IEEE
13 years 11 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
ACSC
2003
IEEE
13 years 8 months ago
2003
IEEE
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...