1. Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.: Hausdorff dimension in exponential time. In: Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 210–217 (2001)
2. Ambos-Spies, K., Neis, H.-C., Terwijn, S.A.: Genericity and measure for exponential time. Theoretical Computer Science 168(1), 3–19 (1996)
3. Athreya, K.B., Hitchcock, J.M., Lutz, J.H., Mayordomo, E.: Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing (to appear)
4. Buhrman, H., van Melkebeek, D.: Hard sets are hard to find. Journal of Computer and System Sciences 59(2), 327–345 (1999)
5. Falconer, K.: The Geometry of Fractal Sets. Cambridge University Press, Cambridge (1985)