Tree Automata and Essential Subtrees
Tree automata and separable sets of input variables
Tron, a combinatorial Game on abstract Graphs
Turing degrees of multidimensional SFTs
Turing Machines and Understanding Computational Complexity
Two conjectures such that the proof of any one of them will lead to the proof that P = NP
Two graph isomorphism polytopes
Two Hands Are Better Than One (up to constant factors)
Two heads are better than two tapes
Two-message quantum interactive proofs are in PSPACE
Two-phase algorithms for the parametric shortest path problem
Two-way finite automata with quantum and classical states
Two-way Quantum One-counter Automata
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
Unary finite automata vs. arithmetic progressions
Unary Subset-Sum is in Logspace
Unbounded-error quantum computation with small space bounds
Undecidability of performance equivalence of Petri nets
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions