The Rise and Fall of the Church-Turing Thesis
The similarity metric
The space complexity of recognizing well-parenthesized expressions in the streaming model: the Index function revisited
The state complexity of L^2 and L^k
The surprizing complexity of generalized reachability games
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
The Threshold for Random k-SAT is 2^k ln2 - O(k)
The traveling salesman problem: A Linear programming formulation of
The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme
The Two Bicliques Problem is in NP intersection coNP
The zero exemplar distance problem
Theory of One Tape Linear Time Turing Machines
Three lines proof of the lower bound for the matrix rigidity
Threshold Saturation in Spatially Coupled Constraint Satisfaction Problems
Threshold values of Random K-SAT from the cavity method
Tight Bounds for Parallel Randomized Load Balancing
Tight bounds for the space complexity of nonregular language recognition by real-time machines
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models
Tile Packing Tomography is NP-hard