Low-Memory Adaptive Prefix Coding

Lower bounds for distributed markov chain problems

Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families

Lower Bounds for Multi-Pass Processing of Multiple Data Streams

Lower Bounds for Sparse Recovery

Lower Bounds for the Average and Smoothed Number of Pareto Optima

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds on Near Neighbor Search via Metric Expansion

Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions

Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs

Lower-Stretch Spanning Trees

LP-Based Approximation Algorithms for Traveling Salesman Path Problems

LP-rounding algorithms for facility-location problems

LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations

LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems