1. Allender, E., Buhrman, H., Koucký, M, van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467–1493 (2006)
2. Allender, E., Hirahara, S.: New insights on the (non-)hardness of circuit minimization and related problems. In: Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS), pp 54:1–54:14 (2017)
3. Allender, E., Koucký, M.: Amplifying lower bounds by means of self-reducibility. J. ACM 57(3), 14:1–14:36 (2010)
4. Allender, E., Koucký, M, Ronneburger, D., Roy, S.: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. J. Comput. Syst. Sci. 77(1), 14–40 (2011)
5. Alon, N., Goldreich, O., Håstad, J, Peralta, R: Simple constructions of almost k-wise independent random variables. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), pp 544–553 (1990)