Likely Structure of NP-complete Degree Manindra Agrawal, Osamu Watanabe, One-Way Functions and the Berman-Hartmanis Conjecture. CCC 2009. Manindra Agrawal, Pseudo-random Generators and the Structure of Complete Degrees, CCC 2002: 139-146. Complete Degrees Under AC^0 Reductions Manindra Agrawal, The Isomorphism Conjecture for Constant Depth Reductions, JCSS 77 (special issue on Karp's Kyoto Prize): 3-13, 2011. Manindra Agrawal, The First-Order Isomorphism Theorem, FSTTCS 2001, LNCS 2245: 70-82. Manindra Agrawal, Towards Uniform AC^0-Isomorphisms, CCC 2001: 13-20. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich, Reducing the complexity of reductions, Computational Complexity 10(2): 117-138, 2001. Manindra Agrawal, Eric Allender, Steven Rudich, Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem, JCSS 57: 127-143, 1999. Complete Degrees Under 1-L and 1-NL Reductions Manindra Agrawal, On the Isomorphism Conjecture for Weak Reducibilities, JCSS 53(2): 267-282, 1996. Manindra Agrawal, Somenath Biswas, Polynomial Isomorphism of 1-L Complete Sets, JCSS 53(2): 155-160, 1996. Manindra Agrawal, DSPACE(n) ?= NSPACE(n): A Degree Theoretic Characterization, JCSS 54(3): 383:392, 1997. Complete Degrees Under Other Weak Reductions Manindra Agrawal, For completeness, sublogarithmic space is no space, Information Processing Letters 82(6): 321-325, 2002. Manindra Agrawal, S. Venkatesh, On the Isomorphism Conjecture for 2DFA Reductions, Intl Journal on Foundations of Computer Science 7(4): 339-352, 1996.
