[14] Optimal parallel selection.
[0] Selection with monotone comparison cost.
[3] Property testing of data dimensionality.
[87] Comparing top k lists.
[42] Algorithms for power savings.
[6] Dynamic TCP acknowledgement: penalizing long delays.
[1] Approximately optimal control of fluid networks.
[17] Minimum cost flows over time without intermediate storage.
[5] Sublogarithmic approximation for telephone multicast: path out of jungle.
[30] On the performance of user equilibria in traffic networks.
[15] Faster approximation algorithms for the minimum latency problem.
[7] Data migration to minimize the average completion time.
[5] Browsing around a digital library.
[5] Binary space partitions for 3D subdivisions.
[3] Allocating vertex pi-guards in simple polygons via pseudo-triangulations.
[18] Straight-skeleton based contour interpolation.
[1] Möbius-invariant natural neighbor interpolation.
[0] Improved bounds on the average length of longest common subsequences.
[40] Directed scale-free graphs.
[13] The cover time of sparse random graphs.
[3] Perfect matchings in random graphs with prescribed minimal degree.
[16] Certifying algorithms for recognizing interval graphs and permutation graphs.
[58] Dominating sets in planar graphs: branch-width and exponential speed-up.
[8] Quick and good facility location.
[1] Chain decompositions and independent trees in 4-connected graphs.
[1] Optimizing misdirection.
[39] Online learning in online auctions.
[63] An approximate truthful mechanism for combinatorial auctions with single parameter agents.
[15] Competitiveness via consensus.
[30] Pass efficient algorithms for approximating large matrices.
[11] Rangesum histograms.
[50] Approximation of functions over redundant dictionaries using coherence.
[11] Counting inversions in lists.
[7] Certifying and repairing solutions to large LPs how good are LP-solvers?
[17] An improved approximation algorithm for the 0-extension problem.
[64] Packing Steiner trees.
[18] Integrality ratio for group Steiner trees and directed steiner trees.
[38] The flow complex: a data structure for geometric modeling.
[24] Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio.
[18] On the combinatorial complexity of euclidean Voronoi cells and convex hulls of d-dimensional spheres.
[7] Perturbations and vertex removal in a 3D delaunay triangulation.
[15] Root comparison techniques applied to computing the additively weighted Voronoi diagram.
[8] Random walks on the vertices of transportation polytopes with constant number of sources.
[8] Smaller explicit superconcentrators.
[0] A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.
[21] A spectral technique for random satisfiable 3CNF formulas.
[23] Random MAX SAT, random MAX CUT, and their phase transitions.
[6] Space-efficient finger search on degree-balanced search trees.
[189] Skip graphs.
[5] Maintaining all-pairs approximate shortest paths under deletion of edges.
[11] A faster and simpler fully dynamic transitive closure.
[162] Data streams: algorithms and applications.
[15] Sparse distance preservers and additive spanners.
[12] Multi-embedding and path approximation of metric spaces.
[12] Approximation algorithm for embedding metrics into a two-dimensional space.
[1] On the complexity of distance-based evolutionary tree reconstruction.
[10] Improved results for directed multicut.
[13] Algorithms for k-colouring and finding maximal independent sets.
[3] Equitable colorings with constant number of colors.
[8] Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph.
[1] A note on the set systems used for broadcast encryption.
[1] Lower bounds for collusion-secure fingerprinting.
[12] Quantum property testing.
[31] Quantum algorithms for some hidden shift problems.
[73] Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk.
[3] Non-independent randomized rounding.
[14] Minimizing weighted flow time.
[3] A combinatorial algorithm for computing a maximum independent set in a t-perfect graph.
[22] Lower bounds for embedding edit distance into normed spaces.
[22] Embedding k-outerplanar graphs into l1.
[4] Embeddings and non-approximability of geometric problems.
[16] Better algorithms for high-dimensional proximity problems via asymmetric embeddings.
[4] Lower bounds for external memory dictionaries.
[0] Online paging with arbitrary associativity.
[0] The set-associative cache performance of search trees.
[25] Computing strongly connected components in a linear number of symbolic steps.
[8] On the rectilinear crossing number of complete graphs.
[11] Matching planar maps.
[6] Dynamic generators of topologically embedded graphs.
[61] Computing homotopic shortest paths in the plane.
[17] Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time.
[38] Edge disjoint paths revisited.
[16] A new approximation algorithm for the asymmetric TSP with triangle inequality.
[5] Approximating asymmetric maximum TSP.
[17] The k-traveling repairman problem.
[12] Directed graphs requiring large numbers of shortcuts.
[6] Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time.
[27] Compact representations of separable graphs.
[16] Labeling schemes for small distances in trees.
[0] On AC⁰ implementations of fusion trees and atomic heaps.
[0] Who cares about permanents?
[0] Between O(nm) and O(n alpha).
[43] Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons.
[11] A 5/4-approximation algorithm for minimum 2-edge-connectivity.
[11] Fault-tolerant facility location.
[13] Efficient sequences of trials.
[2] Pursuit-evasion with imprecise target location.
[0] Unconditional proof of tightness of Johnson bound.
[8] Deterministic identity testing for multivariate polynomials.
[33] Competitive queueing policies for QoS switches.
[16] Dynamic routing on networks with fixed-size buffers.
[17] Dynamic construction of Bluetooth scatternets of fixed degree and low diameter.
[12] Scheduling techniques for media-on-demand.
[30] Smaller core-sets for balls.
[6] Zonotopes as bounding volumes.
[17] Sublinear-time approximation of Euclidean minimum spanning tree.
[6] An approximation algorithm for cutting out convex polygons.
[2] Inferring tree topologies using flow tests.
[23] Wavelength assignment and generalized interval graph coloring.
[6] An improved approximation algorithm for the partial latin square extension problem.
[5] Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.
[54] High-order entropy-compressed text indexes.
[0] Multidimensional matching and fast search in suffix trees.
[3] Inplace 2D matching in compressed images.
[101] The similarity metric.

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