Items where Author is "Allender, Eric"

Article

Allender, Eric ; Arvind, V. ; Mahajan, Meena (2013) Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series Theory of Computing Systems, 53 (3). pp. 503-506. ISSN 1432-4350

Allender, Eric ; Mahajan, Meena (2004) The complexity of planarity testing Information and Computation, 189 (1). pp. 117-134. ISSN 0890-5401

Allender, Eric ; Arvind, V. ; Mahajan, Meena (2003) Arithmetic Complexity, Kleene Closure, and Formal Power Series Theory of Computing Systems, 36 (4). pp. 303-328. ISSN 1432-4350

Agrawal, Manindra ; Allender, Eric ; Datta, Samir ; Vollmer, Heribert ; Wagner, Klaus W. (2000) Characterizing small depth and small space classes by operators of higher types Chicago Journal of Theoretical Computer Science, 2000 . No pp. given. ISSN 1073-0486

Agrawal, Manindra ; Allender, Eric ; Datta, Samir (2000) On TC⁰, AC⁰, and arithmetic circuits Journal of Computer and System Sciences, 60 (2). pp. 395-421. ISSN 0022-0000

Agrawal, Manindra ; Allender, Eric ; Rudich, Steven (1998) Reductions in circuit complexity: an isomorphism theorem and a gap theorem Journal of Computer and System Sciences, 57 (2). pp. 127-143. ISSN 0022-0000

Allender, Eric ; Jiao, Jia ; Mahajan, Meena ; Vinay, V. (1998) Non-commutative arithmetic circuits: depth reduction and size lower bounds Theoretical Computer Science, 209 (1-2). pp. 47-86. ISSN 0304-3975

Agrawal, Manindra ; Impagliazzo, Russell ; Pitassi, Toniann ; Rudich, Steven ; Allender, Eric (1997) Reducing the complexity of reductions Proceedings of the twenty-ninth annual ACM symposium on Theory of computing . pp. 730-738. ISSN 0734-9025