Thresholded Covering Algorithms for Robust and Max-Min Optimization

Thresholds for Extreme Orientability

Tight and simple Web graph compression

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs

Tight Approximation of Image Matching

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems

Tight Bounds for Blind Search on the Integers

Tight Bounds for Distributed Functional Monitoring

Tight Bounds for Hashing Block Sources

Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems

Tight Bounds for Online Stable Sorting

Tight Cell-Probe Bounds for Online Integer Multiplication and Convolution

Tight lower bounds for online labeling problem

Tight Thresholds for Cuckoo Hashing via XORSAT

Tightness of LP via Max-product Belief Propagation

Tiling with bars under tomographic constraints

Time and Memory Efficient Lempel-Ziv Compression Using Suffix Arrays

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding

Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas