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
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Limit laws for the height in PATRICIA tries
Journal of Algorithms - Analysis of algorithms
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
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
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
Journal of Experimental Algorithmics (JEA)
Probabilistic Transforms for Combinatorial Urn Models
Combinatorics, Probability and Computing
Concentration of Size and Path Length of Tries
Combinatorics, Probability and Computing
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
(Un)expected behavior of digital search tree profile
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Compression of graphical structures
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Average case analysis of algorithms
Algorithms and theory of computation handbook
The expected profile of digital search trees
Journal of Combinatorial Theory Series A
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On lempel-ziv complexity of sequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
| Hi-index | 0.00 |