1. Anti-mitotic recursively enumerable sets;Ambos-Spies;Math. Log. Q.,1985
2. Complexity of programs to determine whether natural numbers not greater than n belong to recursively enumerable set;Barzdin;Soviet Math. Dokl.,1968
3. Computably enumerable sets in the Solovay and the strong weak truth table degrees;Barmpalias,2005
4. On strings with trivial Kolmogorov complexity;Barmpalias;Int. J. Softw. Inform.,2011
5. George Barmpalias, Universal computably enumerable sets and initial segment prefix-free complexity, in press.