Locally connected spanning trees on graphs

Locating Depots for Capacitated Vehicle Routing

Locating regions in a sequence under density constraints

Locating Restricted Facilities on Binary Maps

Logarithmic Lower Bounds in the Cell-Probe Model

Longest Wait First for Broadcast Scheduling

Lossless data compression on GPGPU architectures

Low congestion online routing and an improved mistake bound for online prediction of graph labeling

Low Rank Matrix-Valued Chernoff Bounds and Approximate Matrix Multiplication

Low-Degree Spanning Trees of Small Weight

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