Almost Settling the Hardness of Noncommutative Determinant
Almost-natural proofs
Alternating Hierarchies for Time-Space Tradeoffs
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
Amazons is PSPACE-complete
An additive combinatorics approach to the log-rank conjecture in communication complexity
An additivity theorem for plain Kolmogorov complexity
An algebraic approach to complexity of data stream computations
An algorithmic complexity interpretation of Lin's third law of information theory
An Almost Optimal Rank Bound for Depth-3 Identities
An analysis of a random algorithm for estimating all the matchings
An approximation algorithm for approximation rank
An approximation trichotomy for Boolean #CSP
An Average Analysis of Backtracking on Random Constraint Satisfaction Problems
An Average Case NP-complete Graph Problem
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
An effective Procedure for Speeding up Algorithms
An Elegant Argument that P is not NP
An Exact 2.9416^n Algorithm for the Three Domatic Number Problem
An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas