Digital search trees revisited
SIAM Journal on Computing
On the balance property of Patricia tries: external path length viewpoint
Theoretical Computer Science
On the variance of the external path length in a symmetric digital trie
Discrete Applied Mathematics - Combinatorics and complexity
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
A characterization of digital search trees from the successful search viewpoint
Theoretical Computer Science
Elements of information theory
Elements of information theory
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Limiting distribution for the depth in Patricia tries
SIAM Journal on Discrete Mathematics
A generalized suffix tree and its (un)expected asymptotic behaviors
SIAM Journal on Computing
Digital Search Trees Again Revisited: The Internal Path Length Perspective
SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
| Hi-index | 0.00 |