A compendium of key search references
ACM SIGIR Forum
A functional equation often arising in the analysis of algorithms (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Patricia tries again revisited
Journal of the ACM (JACM)
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Laws of large numbers and tail inequalities for random tries and PATRICIA trees
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLAN
Wireless Personal Communications: An International Journal
Some results on tries with adaptive branching
Theoretical Computer Science
Index Structures for Path Expressions
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Some Results on Tries with Adaptive Branching
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On the Average Redundancy Rate of the Lempel-Ziv Code with K-Error Protocol
DCC '00 Proceedings of the Conference on Data Compression
Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile
DCC '95 Proceedings of the Conference on Data Compression
Improved Behaviour of Tries by the "Symmetrization" of the Source
DCC '02 Proceedings of the Data Compression Conference
PAT-trees with the deletion function as the learning device for linguistic patterns
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
On the average depth of asymmetric LC-tries
Information Processing Letters
On the average depth of asymmetric LC-tries
Information Processing Letters
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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.00 |