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

Validating XML Documents in the Streaming Model with External Memory

Variants of Constrained Longest Common Subsequence

Various Solutions to the Firing Squad Synchronization Problems

Vector Bin Packing with Multiple-Choice

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter

Vertex Sparsifiers and Abstract Rounding Algorithms

Vertex Sparsifiers: New Results from Old Techniques

Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections

Watermarking Digital Images Based on a Content Based Image Retrieval Technique