1. On TC0, AC0, and Arithmetic Circuits;Agrawal;J. Comput. System Sci.,2000
2. Reducing the complexity of reductions;Agrawal;Comput. Complexity,2001
3. E. Allender, The division breakthroughs, L. Fortnow (Ed.), The Computational Complexity Column, EATCS Bull. 74, (2001), 61–77.
4. E. Allender, A. Ambainis, D.A. Mix Barrington, S. Datta, H. LêThanh, Bounded depth arithmetic circuits: counting and closure, in: Proceedings of the 26th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1644, 1999, pp. 149–158.
5. Uniform circuits for division;Allender;Electron. Colloq. Comput. Complexity,2000