1. Allender, E., Buhrman, H., Koucky, M., van Melkebeek, D., Ronneburger, D.: Power from random strings. In: Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, pp. 669–678. IEEE, Los Alamitos (2002)
2. Babai, L.: Trading group theory for randomness. In: Proceedings of the 17th ACM Symposium on the Theory of Computing, pp. 421–429. ACM, New York (1985)
3. Buhrman, H., Fortnow, L.: Distinguishing complexity and symmetry of information. Technical Report TR-95-11, Department of Computer Science, The University of Chicago (1995)
4. Buhrman, H., Fortnow, L., Laplante, S.: Resource bounded Kolmogorov complexity revisited. SIAM Journal on Computing 31(3), 887–905 (2002)
5. Buhrman, H., Laplante, S., Miltersen, P.B.: New bounds for the language compression problem. In: Proceedings of the 15th IEEE Conference on Computational Complexity, pp. 126–130. IEEE, Los Alamitos (2000)