| Web Similarity in Sets of Search Terms Using Database Queries | 0 | 0.34 | 2020 |
| Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines | 0 | 0.34 | 2019 |
| Identification of Probabilities. | 0 | 0.34 | 2017 |
| On the rate of decrease in logical depth. | 0 | 0.34 | 2017 |
| Algorithmic Identification of Probabilities. | 0 | 0.34 | 2013 |
| Normalized Google Distance of Multisets with Applications. | 0 | 0.34 | 2013 |
| On the logical depth function | 0 | 0.34 | 2013 |
| Normalized Compression Distance of Multiples | 0 | 0.34 | 2012 |
| Identification of Probabilities of Languages | 0 | 0.34 | 2012 |
| Turing Machines and Understanding Computational Complexity | 0 | 0.34 | 2012 |
| Ray Solomonoff, Founding Father of Algorithmic Information Theory. | 0 | 0.34 | 2010 |
| Rate distortion and denoising of individual data using Kolmogorov complexity | 15 | 1.66 | 2010 |
| Normalized Information Distance is Not Semicomputable | 0 | 0.34 | 2010 |
| The probabilistic analysis of language acquisition: Theoretical, computational, and experimental analysis | 3 | 0.45 | 2010 |
| Depth as Randomness Deficiency | 4 | 0.46 | 2009 |
| Normalized Web Distance and Word Similarity | 7 | 0.65 | 2009 |
| Nonapproximability of the normalized information distance | 7 | 0.59 | 2009 |
| Approximation of the two-part MDL code | 3 | 0.54 | 2009 |
| Analysis of Sorting Algorithms by Kolmogorov Complexity (A Survey) | 1 | 0.43 | 2009 |
| Individual communication complexity | 3 | 0.40 | 2007 |
| Automatic Meaning Discovery Using Google | 16 | 1.47 | 2006 |
| Tales of Huffman | 0 | 0.34 | 2006 |
| Similarity of objects and the meaning of words | 11 | 0.77 | 2006 |
| 06051 Abstracts Collection -- Kolmogorov Complexity and Applications | 0 | 0.34 | 2006 |
| Kolmogorov Complexity and Applications, 29.01. - 03.02.2006 | 9 | 1.60 | 2006 |
| On Algorithmic Rate-Distortion Function | 1 | 0.36 | 2006 |
| Individual Communication Complexity: Extended Abstract | 1 | 0.36 | 2004 |
| Kolmogorov's structure functions and model selection | 36 | 2.81 | 2004 |
| A Theory of Lossy Compression for Individual Data | 1 | 0.43 | 2004 |
| Sharpening Occam's razor. | 0 | 0.34 | 2003 |
| Clustering by compression | 288 | 16.03 | 2003 |
| Algorithmic Clustering of Music | 25 | 3.18 | 2003 |
| Randomized two-process wait-free test-and-set | 9 | 0.54 | 2002 |
| Correction to "algorithmic statistics" | 0 | 0.34 | 2002 |
| Correction to "Quantum Kolmogorov complexity based on classical descriptions | 0 | 0.34 | 2002 |
| On a Generalized Ruin Problem | 1 | 0.63 | 2001 |
| The Quantum Computing Challenge | 0 | 0.34 | 2001 |
| The Generalized Universal Law of Generalization | 11 | 0.99 | 2001 |
| Counting is easy | 0 | 0.34 | 2001 |
| Bounded concurrent timestamp systems using vector clocks | 17 | 0.79 | 2001 |
| A lower bound on the average-case complexity of shellsort | 10 | 0.97 | 2000 |
| Average-Case Analysis of Algorithms Using Kolmogorov Complexity | 1 | 0.36 | 2000 |
| New applications of the incompressibility method: part II | 11 | 0.89 | 2000 |
| New Applications of the Incompressibility Method. | 1 | 0.39 | 1999 |
| Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method | 10 | 1.27 | 1999 |
| Average-Case Complexity of Shellsort (Preliminary version) | 6 | 0.46 | 1999 |
| The Expected Size of Heilbronn's Triangles | 4 | 0.60 | 1999 |
| Some Examples of Average-case Analysis by the Imcompressibility Method | 0 | 0.34 | 1999 |
| Mutual search | 7 | 0.75 | 1999 |
| A discipline of evolutionary programming | 5 | 0.46 | 1999 |
