1. A c.e. real that cannot be SW-computed by any Ω number;Barmpalias;Notre Dame J. Form. Log.,2006
2. Working with strong reducibilities above totally ω-c.e. degrees and array computable degrees;Barmpalias;Trans. Amer. Math. Soc.,2010
3. Turing degrees of reals of positive effective packing dimension;Downey;Inform. Process. Lett.,2008
4. Algorithmic Randomness and Complexity;Downey,2010
5. Array non-recursive degrees and genericity;Downey,1996