A linearly computable measure of string complexity

This publication has 12 references indexed in Scilit:

• On extending de Bruijn sequences
  Information Processing Letters, 2011
• Lempel-Ziv Dimension for Lempel-Ziv Compression
  2006
• Clustering by Compression
  IEEE Transactions on Information Theory, 2005
• Relations between varieties of kolmogorov complexities
  Theory of Computing Systems, 1996
• Suffix Arrays: A New Method for On-Line String Searches
  SIAM Journal on Computing, 1993
• A Pseudorandom Sequence--How Random Is It?
  The American Mathematical Monthly, 1992
• On the Complexity of Finite Sequences
  IEEE Transactions on Information Theory, 1976
• A Theory of Program Size Formally Identical to Information Theory
  Journal of the ACM, 1975
• Process complexity and effective random tests
  Journal of Computer and System Sciences, 1973
• A Mathematical Theory of Communication
  Bell System Technical Journal, 1948