- RELATING EQUIVALENCE AND REDUCIBILITY TO SPARSE SETS ERIC ALLENDER
- , and Arithmetic Circuits Manindra Agrawal
- THE COMPLEXITY OF COMPUTING MAXIMAL WORD FUNCTIONS
- Rudimentary reductions revisited Eric Allender
- Derandomization and Distinguishing Complexity Eric Allender
- Making Nondeterminism Unambiguous Klaus Reinhardt
- Limitations of the Upward Separation Technique Eric Allender
- Uniform Derandomization from Pathetic Lower Bounds Eric Allender
- Uniform Constant-Depth Threshold Circuits for Division and Iterated Multiplication
- Isolation, Matching, and Counting: Uniform and Nonuniform Upper Bounds
- NL-printable sets and Nondeterministic Kolmogorov Complexity
- The Permanent Requires Large Uniform Threshold Circuits
- Descriptional Complexity of Formal Systems (Draft) Deadline for submissions: April 7 27, 2008(strict)
- Complexity Classes Eric Allender
- Arithmetic Complexity, Kleene Closure, and Formal Power Series
- Grid Graph Reachability Problems Eric Allender
- Time-Space Tradeoffs in the Counting ERIC ALLENDER
- Relationships Among PL, L, and the Determinant Eric Allendery
- The complexity of planarity testing Eric Allender
- Power from Random Strings Eric Allender
- Limits on the Computational Power of Random Strings Eric Allender
- Avoiding Simplicity is Complex Eric Allender
- New Surprises from Self-Reducibility Eric Allender
- The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory
- Amplifying Lower Bounds by Means of Self-Reducibility
- Other Complexity Classes and Measures Eric Allender1
- Yu. L Ershov, S. S. Goncharov, A. Nerode, J. B. Remmel (eds.), Handbookof Recursive Mathematics, Vol. 1 and 2.Amsterdam, The
- Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
- On the Complexity of Numerical Analysis Eric Allender
- MINIMIZING DNF FORMULAS AND AC0 CIRCUITS GIVEN A TRUTH TABLE ERIC ALLENDER, LISA HELLERSTEIN, PAUL MCCABE , TONIANN PITASSI , AND MICHAEL
- What Can be Efficiently Reduced to the Kolmogorov-Random Strings?
- SIGACT News Complexity Theory Column 19 Lane A. Hemaspaandra
- Basic Complexity Eric Allender
- SOME POINTED QUESTIONS CONCERNING ASYMPTOTIC LOWER BOUNDS, AND NEWS FROM THE ISOMORPHISM
- A Lower Bound for Primality Eric Allender
- The complexity of matrix rank and feasible systems of linear Eric Allendery Robert Bealsz Mitsunori Ogiharax
- RUSPACElog n DSPACElog 2 n= log log n
- Circuit Complexity before the Dawn of the New Eric Allender?
- A Clari cation Concerning the L Hierarchy Eric Allender
- Measure on P: Robustness of the Notion Eric Allendery
- Algebraic methods for proving lower bounds in circuit Eric Allender
- Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory
- Lower Bounds for the Low Hierarchy1 Eric Allender2
- Oracles versus Proof Techniques that Do Not Relativize1 Eric Allender2
- Planar and Grid Graph Reachability Problems Eric Allender
- Topology inside NC1 Eric Allender
- Arithmetic Circuits and Counting Complexity Eric Allender
- Characterizing Small Depth and Small Space by Operators of Higher Types
- Width-Bounded Reducibility and Binary Search over Complexity Classes
- The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
- Measure on Small Complexity Classes, with Applications for BPP Eric Allender
- The Directed Planar Reachability Problem Eric Allender1
- Complexity Theory Eric W. Allender1
- Complexity of Finite-Horizon Markov Decision Process Problems
- Reducibility and Completeness Eric Allender1
- Counting Problems Computationally Equivalent to Computing the Determinant
- The Division Breakthroughs Eric Allender 1
- On the power of algebraic branching programs of width two Eric Allender
- Randomness as Circuit Complexity (and the Connection to Pseudorandomness)
- A Status Report on the P versus NP Question Eric Allender
- When Worlds Collide: Derandomization, Lower Bounds, and
- Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata1
- Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem.
- Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
- A First-Order Isomorphism Theorem Eric Allendery
- Almost-Everywhere Complexity Hierarchies for Nondeterministic Time
- Bounded Depth Arithmetic Circuits: Counting and Closure Eric Allender
- Corrigendum for Arithmetic Complexity, Kleene Closure, and Formal Power Series
- Depth Reduction for Circuits of Unbounded Fan-In
- On Strong Separations from AC0 Eric Allendery
- Uniform Derandomization from Pathetic Lower Bounds Eric Allender
