| 1 | -- | 0 | Rod Downey. Computability, Complexity and Randomness |
| 2 | -- | 27 | Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle. Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees |
| 28 | -- | 47 | Martijn Baartse, George Barmpalias. On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity |
| 48 | -- | 64 | Douglas Cenzer, Rebecca Weber. Effective Randomness of Unions and Intersections |
| 65 | -- | 79 | Willem L. Fouché. Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures |
| 80 | -- | 94 | Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle. Time-Bounded Kolmogorov Complexity and Solovay Functions |
| 95 | -- | 112 | María López-Valdés, Elvira Mayordomo. Dimension Is Compression |
| 113 | -- | 132 | Kenshi Miyabe. Characterization of Kurtz Randomness by a Differentiation Theorem |
| 133 | -- | 147 | Boris Ryabko, Zhanna Reznikova, Alexey Druzyaka, Sofia Panteleeva. Using Ideas of Kolmogorov Complexity for Studying Biological Texts |
| 148 | -- | 161 | Antoine Taveneaux. Axiomatizing Kolmogorov Complexity |
| 162 | -- | 178 | Luis Filipe Coelho Antunes, Armando Matos, Alexandre Pinto, Andre Souto, Andreia Teixeira. One-Way Functions Using Algorithmic and Classical Information Theories |