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

Uniform test of algorithmic randomness over a general space

Universal Computation is 'Almost Surely' Chaotic

Universal Quantum Circuits

Unpredictability and Computational Irreducibility

Using a Skewed Hamming Distance to Speed Up Deterministic Local Search

Using Elimination Theory to construct Rigid Matrices

Using Kolmogorov Complexity for Understanding Some Limitations on Steganography

Using the No-Search Easy-Hard Technique for Downward Collapse