Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Content management on server farm with layer-7 routing
Proceedings of the 2002 ACM symposium on Applied computing
Suffix vector: space- and time-efficient alternative to suffix trees
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Some results on tries with adaptive branching
Theoretical Computer Science
Suffix Vector: A Space-Efficient Suffix Tree Representation
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Some Results on Tries with Adaptive Branching
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Efficient trie-based sorting of large sets of strings
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
On the average depth of asymmetric LC-tries
Information Processing Letters
LZ trie and dictionary compression
Software—Practice & Experience
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
System support for web hosting services on server clusters
Computers and Electrical Engineering
Partial fillup and search time in LC tries
ACM Transactions on Algorithms (TALG)
A Table Compression Method for Extended Aho-Corasick Automaton
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On the average depth of asymmetric LC-tries
Information Processing Letters
Distributed and paged suffix trees for large genetic databases
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
SILT: a memory-efficient, high-performance key-value store
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Analysis of a class of tries with adaptive multi-digit branching
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.89 |