1. What can be efficiently reduced to the Kolmogorov-random strings?;Allender;Ann. Pure Appl. Logic,2006
2. Power from random strings;Allender;SIAM J. Comput.,2006
3. E. Allender, L. Friedman, W. Gasarch, Exposition of the Muchnik–Positselsky construction of a prefix free entropy function that is not complete under truth-table reductions, Technical Report TR10-138, Electronic Colloquium on Computational Complexity, 2010.
4. E. Allender, L. Friedman, W. Gasarch, Limits on the computational power of random strings, Technical Report TR10-139, Electronic Colloquium on Computational Complexity, 2010.
5. Limits on the computational power of random strings;Allender,2011