The Dimensions of Individual Strings and Sequences
The Exponential Time Complexity of Computing the Probability That a Graph is Connected
The Fastest and Shortest Algorithm for All Well-Defined Problems
The Gaussian Surface Area and Noise Sensitivity of Degree-$d$ Polynomials
The hardness of Median in the synchronized bit communication model
The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence
The influence lower bound via query elimination
The intersection of two halfspaces has high threshold degree
The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent
The Mixing Time of Glauber Dynamics for Colouring Regular Trees
The model checking problem for intuitionistic propositional logic with one variable is AC1-complete
The Multivariate Resultant is NP-hard in any Characteristic
The One-Way Communication Complexity of Group Membership
The P versus NP Brief
The P versus NP Problem
The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
The Partition Bound for Classical Communication Complexity and Query Complexity
The Pattern Matrix Method (Journal Version)
The Phase Transition in Exact Cover
The Power of Depth 2 Circuits over Algebras