The Computational Complexity of Computing the Permanent of a Matrix
The Computational Complexity of Disconnected Cut and 2K2-Partition
The computational complexity of Minesweeper
The Computational Complexity of the Traveling Salesman Problem
The Computational Power of Benenson Automata
The computational power of population protocols
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
The Consequences of Eliminating NP Solutions
The descriptive complexity approach to LOGCFL
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract)
The DFAs of Finitely Different Languages
The Dichotomy of List Homomorphisms for Digraphs
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