**[18]**Static optimality and dynamic search-optimality in lists and trees.**[2]**Optimal time-space trade-offs for non-comparison-based sorting.**[9]**Union-find with deletions.**[18]**A locality-preserving cache-oblivious dynamic dictionary.**[60]**Cache oblivious search trees via binary trees of small height.**[6]**An approximation algorithm for the group Steiner problem.**[25]**On directed Steiner trees.**[7]**An 8/13-approximation algorithm for the asymmetric maximum TSP.**[11]**Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.**[8]**An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph.**[76]**Censorship resistant peer-to-peer content addressable networks.**[8]**Web caching with request reordering.**[4]**Improved algorithms for the data placement problem.**[7]**Undiscretized dynamic programming: faster algorithms for facility location and related problems on trees.**[3]**Temporary tasks assignment resolved.**[20]**Dense point sets have sparse Delaunay triangulations: or "... but not too nasty".**[9]**Delaunay triangulation programs on surface data.**[33]**Quality meshing with weighted Delaunay refinement.**[21]**Linear-size approximate voronoi diagrams.**[11]**Motorcycle graphs and straight skeletons.**[16]**Faster approximation schemes for fractional multicommodity flow problems.**[24]**Flows over time with load-dependent transit times.**[44]**Improved bounds for the unsplittable flow problem.**[27]**NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow.**[35]**How unfair is optimal routing?**[30]**Approximation algorithms for grammar-based compression.**[11]**Improving table compression with combinatorial optimization.**[13]**Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits.**[50]**Succinct representations of lcp information and improvements in the compressed suffix arrays.**[63]**Succinct indexable dictionaries with applications to encoding k-ary trees and multisets.**[0]**Jenga.**[9]**Guessing secrets with inner product questions.**[19]**Guessing secrets efficiently via list decoding.**[6]**How to cut a cake almost fairly.**[0]**The mathematics of playing golf.**[26]**Computing shortest paths with comparisons and additions.**[0]**An optimal algorithm for checking regularity (extended abstract).**[12]**Edge dominating and hypomatchable sets.**[19]**An algorithm for counting maximum weighted independent sets and its applications.**[12]**Algorithms for quantified Boolean formulas.**[14]**Balls and bins models with feedback.**[5]**A note on random 2-SAT with prescribed literal degrees.**[5]**Mixing time and long paths in graphs.**[31]**The diameter of a long range percolation graph.**[7]**Is the internet fractal?**[8]**Center and diameter problems in plane triangulations and quadrangulations.**[15]**Symmetric drawings of triconnected planar graphs.**[5]**Layout area of the hypercube (extended abstract).**[19]**I/O-optimal algorithms for planar graphs using separators.**[0]**Polynomial time recognition of P4-structure.**[24]**Adaptive intersection and t-threshold problems.**[7]**Separable attributes: a technique for solving the sub matrices character count problem.**[4]**Tiling groups for Wang tiles.**[2]**Generating random factored numbers, easily.**[134]**Tight bounds for worst-case equilibria.**[18]**Broadcast scheduling: when fairness is fine.**[16]**Harmonic broadcasting is optimal.**[22]**Windows scheduling problems for broadcast systems.**[0]**Scheduling protocols for switches with large envelopes.**[3]**Covering shapes by ellipses.**[3]**Slice and dice: a simple, improved approximate tiling recipe.**[8]**Binary space partitions for line segments with a limited number of directions.**[11]**Closest-point problems simplified on the RAM.**[14]**Semi-online maintenance of geometric optima and measures.**[0]**Generalized clustering.**[0]**New bounds for multi-dimensional packing.**[12]**Computer assisted proof of optimal approximability results.**[5]**MAX CUT in cubic graphs.**[0]**Approximating minimum unsatisfiability of linear equations.**[11]**On-line algorithms for the dynamic traveling repair problem.**[15]**Competitive on-line switching policies.**[7]**A randomized online algorithm for bandwidth utilization.**[5]**Caching with expiration times.**[25]**On-line scheduling of a single machine to minimize total weighted completion time.**[17]**Hardware-assisted computation of depth contours.**[21]**The freeze-tag problem: how to wake up a swarm of robots.**[17]**The wake up and report problem is time-equivalent to the firing squad synchronization problem.**[26]**Tree exploration with little memory.**[3]**Efficient proper 2-coloring of almost disjoint hypergraphs.**[15]**Experimental analysis of simple, distributed vertex coloring algorithms.**[13]**On semidefinite programming relaxations for graph coloring and vertex cover.**[6]**Approximating k-cuts via network strength.**[36]**Reductions in streaming algorithms, with an application to counting triangles in graphs.**[88]**Sampling from a moving window over streaming data.**[236]**Maintaining stream statistics over sliding windows (extended abstract).**[18]**Testing satisfiability.**[8]**Efficient pattern-matching with don't cares.**[30]**Efficient algorithms for document retrieval problems.**[42]**The string edit distance matching problem with moves.**[4]**Simple approximation algorithm for nonoverlapping local alignments.**[27]**A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.**[14]**On adaptive deterministic gossiping in ad hoc radio networks.**[5]**Expansion of product replacement graphs.**[33]**Explicit constructions of selectors and related combinatorial structures, with applications.**[13]**Derandomized dimensionality reduction with applications.**[6]**Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.**[10]**Existence theorems, lower bounds and algorithms for scheduling to meet two objectives.**[28]**Scheduling split intervals.**[14]**Throughput maximization of real-time scheduling with batching.**[1]**(Incremental) priority algorithms.**[30]**Improved algorithms for stretch scheduling.**[21]**Shape dimension and approximation from samples.**[33]**Smooth-surface reconstruction in near-linear time.**[10]**Computing the writhing number of a polygonal knot.**[0]**Pseudo-line arrangements: duality, algorithms, and applications.**[5]**On the overlay of envelopes in four dimensions.**[12]**Preprocessing an undirected planar network to enable fast approximate distance queries.**[17]**Approximate distance oracles for geometric graphs.**[10]**Oracles for distances avoiding a link-failure.**[15]**Roundtrip spanners and roundtrip routing in directed graphs.**[5]**Light spanners and approximate TSP in weighted graphs with forbidden minors.**[14]**Capacitated vertex covering with applications.**[23]**Construction of probe interval models.**[22]**A new algorithm for protein folding in the HP model.**[1]**An optimal (expected time) algorithm for minimizing lab costs in DNA sequencing.**[0]**Approximating minimum quartet inconsistency (abstract).**[24]**Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning.**[30]**Smoothed analysis of the perceptron algorithm for linear programming.**[17]**A fully combinatorial algorithm for submodular function minimization.**[1]**0/1 optimization and 0/1 primal separation are equivalent.**[22]**Labeling schemes for flow and connectivity.**[30]**Reachability and distance queries via 2-hop labels.**[52]**Improved labeling scheme for ancestor queries.**[56]**A comparison of labeling schemes for ancestor queries.**[43]**Incentive-compatible online auctions for digital goods.**[30]**Online algorithms for market clearing.**[19]**Pricing multicasting in more practical network models.**[68]**Frugal path mechanisms.**[12]**Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems.

Created by Piotr Indyk and Suresh Venkatasubramanian. Original idea by Michael Mitzenmacher.