1. K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, Effective strong dimension, algorithmic information, and computational complexity. In: Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, pp. 632-643 (Springer-Verlag, 2004).
2. R. Downey, and D. Hirschfeldt, Algorithmic Randomness and Complexity (Springer-Verlag, 2006).
3. S. A. Fenner, Gales and supergales are equivalent for defining constructive Hausdorff dimension. Technical Report cs. CC/0208044, Computing Research Repository, 2002.
4. Scaled dimension and nonuniform complexity;Hitchcock;J. Computer System Sciences,2004
5. Gales suffice for constructive dimension;Hitchcock;Information Processing Letters,2003