Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees and Graphs

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

Lipschitz Unimodal and Isotonic Regression on Paths and Trees

List decoding of noisy Reed-Muller-like codes

List Factoring and Relative Worst Order Analysis

Listing All Maximal Cliques in Large Sparse Real-World Graphs

Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time

Local Approximation Schemes for Topology Control

Local Search Heuristics For The Multidimensional Assignment Problem

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