Digital search trees revisited
SIAM Journal on Computing
The evaluation of an alternative sum with applications to the analysis of some data structures
Information Processing Letters
A characterization of digital search trees from the successful search viewpoint
Theoretical Computer Science
Digital Search Trees Again Revisited: The Internal Path Length Perspective
SIAM Journal on Computing
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
Asymptotic enumeration methods
Handbook of combinatorics (vol. 2)
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Analytical depoissonization and its applications
Theoretical Computer Science
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
IEEE Transactions on Information Theory
Average case analysis for tree labelling schemes
Theoretical Computer Science
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |