1. Bauwens, B.: Computability in Statistical Hypothesis Testing, and Characterizations of Directed Influence in Time Series Using Kolmogorov Complexity. Ph.D thesis, University of Gent (2010)
2. Bauwens, B., Makhlin, A., Vereshchagin, N., Zimand, M.: Short lists with short programs in short time. Proceedings 28-th IEEE Conference on Computational Complexity (CCC), Stanford CA, 98–108 (2013)
3. Gács, P., Tromp, J., Vitányi, P.M.B.: Algorithmic statistics. IEEE Trans. Inf. Theory 47(6), 2443–2463 (2001)
4. Guruswami, V.: List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition, Springer (2004)
5. Kolmogorov, A.N.: The complexity of algorithms and the objective definition of randomness. Summary of the talk presented April 16, 1974 at Moscow Mathematical Society. Uspekhi matematicheskich nauk 29(4-178), 155 (1974)