Self-adjusting binary search trees
Journal of the ACM (JACM)
A guided tour of Chernoff bounds
Information Processing Letters
Randomized algorithms
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Journal of the ACM (JACM)
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
An example of a computable absolutely normal number
Theoretical Computer Science
Compressing probability distributions
Information Processing Letters
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
ACM Computing Surveys (CSUR)
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Implicit compression boosting with applications to self-indexing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Alphabet-independent compressed text indexing
ESA'11 Proceedings of the 19th European conference on Algorithms
Journal of Discrete Algorithms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On compressing and indexing repetitive sequences
Theoretical Computer Science
On the value of multiple read/write streams for data compression
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.89 |
We briefly survey some concepts related to empirical entropy--normal numbers, de Bruijn sequences and Markov processes-- and investigate how well it approximates Kolmogorov complexity. Our results suggest lth-order empirical entropy stops being a reasonable complexity metric for almost all strings of length m over alphabets of size n about when nl surpasses m.