1. E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, and D. Ronneburger. Power from random strings. In Proc. IEEE FOCS, pages 669–678, 2002.
2. A very hard log-space counting class;Àlvarez;Theoretical Computer Science,1993
3. A note on logspace optimization;Àlvarez;Computational Complexity,1995
4. E. Allender, M. Koucký, D. Ronneburger, and S. Roy. Derandomization and distinguishing complexity. In Proc. IEEE Conf. on Comput. Complexity. 2003.
5. E. Allender. When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity. In Proc. FST&TCS, volume 2245 of Lecture Notes in Computer Science, pages 1–15, 2001.