Unbiased Matrix Rounding

Unconstrained and Constrained Fault-Tolerant Resource Allocation

Understanding maximal repetitions in strings

Unified Compression-Based Acceleration of Edit-Distance Computation

Uniform unweighted set cover: The power of non-oblivious local search

Unifying the Landscape of Cell-Probe Lower Bounds

Unifying two Graph Decompositions with Modular Decomposition

Upper Bounds for Maximally Greedy Binary Search Trees

Upward Point Set Embeddability for Convex Point Sets is in $P$

Upward Point-Set Embeddability

Uses of randomness in computation

Using a Non-Commutative Bernstein Bound to Approximate Some Matrix Algorithms in the Spectral Norm

Using Combinatorics to Prune Search Trees: Independent and Dominating Set

Using CSP To Improve Deterministic 3-SAT

Using Data Compressors to Construct Rank Tests

Using Hashing to Solve the Dictionary Problem (In External Memory)

Using Images to create a Hierarchical Grid Spatial Index

Using Neighborhood Diversity to Solve Hard Problems