Routing on longest-matching prefixes
IEEE/ACM Transactions on Networking (TON)
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Time-Space Trade-Off Analysis of Morphic Trie Images
IEEE Transactions on Knowledge and Data Engineering
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
LZ trie and dictionary compression
Software—Practice & Experience
A compact static double-array keeping character codes
Information Processing and Management: an International Journal
| Hi-index | 0.00 |