1. Reductions in circuit complexity: an isomorphism theorem and a gap theorem;Agrawal;J. Comput. Syst. Sci.,1998
2. Uniform derandomization from pathetic lower bounds;Allender;Philos. Trans. - Royal Soc., Math. Phys. Eng. Sci.,2012
3. A note on hardness under projections for graph isomorphism and time-bounded Kolmogorov complexity;Allender,2020
4. Power from random strings;Allender;SIAM J. Comput.,2006
5. Zero knowledge and circuit minimization;Allender;Inf. Comput.,2017