[23] Clustering to minimize the sum of cluster diameters.
[42] Approximating min-sum k-clustering in metric spaces.
[151] Local search heuristic for k-median and facility location problems.
[4] Profit-earning facility location.
[76] One-dimensional quantum walks.
[107] Quantum walks on graphs.
[38] Quantum algorithms for solvable groups.
[74] Quantum mechanical algorithms for the nonabelian hidden subgroup problem.
[11] Minimax parametric optimization problems and multi-dimensional parametric searching.
[24] Algorithms for minimizing weighted flow time.
[30] Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
[67] Stackelberg scheduling strategies.
[11] Quantum computers that can be simulated classically in polynomial time.
[30] Interaction in quantum communication and the complexity of set disjointness.
[33] A new protocol and lower bounds for quantum coin flipping.
[57] Loss-less condensers, unbalanced expanders, and extractors.
[61] Conditions on input vectors for consensus solvability in asynchronous distributed systems.
[107] Spatial gossip and resource location protocols.
[14] (1+epsilon, beta)-spanner constructions for general graphs.
[109] Approximate distance oracles.
[30] Extractor codes.
[12] Excellent codes from modular curves.
[19] Sparse polynomial approximation in finite fields.
[22] Randomness efficient identity testing of multivariate polynomials.
[9] Fully-dynamic min-cut.
[21] Computing crossing numbers in quadratic time.
[1] Euler paths in series parallel graphs.
[19] Decidability of string graphs.
[36] Learning mixtures of arbitrary gaussians.
[27] Learning DNF in time 2^{Õ(n^1/3)}.
[29] Sampling algorithms: lower bounds and applications.
[11] Testing metric properties.
[23] Testing of matrix properties.
[127] Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time.
[15] One line and n points.
[4] A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.
[2] Lower bounds for intersection searching and fractional cascading in higher dimension.
[7] Sharp threshold and scaling window for the integer partitioning problem.
[52] A sharp threshold in proof complexity.
[44] Regular resolution lower bounds for the weak pigeonhole principle.
[2] The complexity of analytic tableaux.
[89] Applications of approximation algorithms to cooperative games.
[9] Approximation algorithms for constrained for constrained node weighted steiner tree problems.
[35] A constant factor approximation for the single sink edge installation problems.
[58] Provisioning a virtual private network: a network design problem for multicommodity flow.
[6] Explicit lower bound of 4.5n - o(n) for boolena circuits.
[15] Lower bounds for matrix product, in bounded depth circuits with arbitrary gates.
[10] A read-once branching program lower bound of Omega(2^n/4) for integer multiplication using universal.
[17] On the cell probe complexity of membership and perfect hashing.
[8] On the integrality ratio of semidefinite relaxations of MAX CUT.
[32] Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming.
[53] Non-approximability results for optimization problems on bounded degree instances.
[3] Colouring graphs when the number of colours is nearly the maximum degree.
[149] Data-streams and histograms.
[13] Optimal static range reporting in one dimension.
[9] Biased dictionaries with fast insert/deletes.
[15] Anti-presistence: history independent data structures.
[22] Dynamic TCP acknowledgement and other stories about e/(e-1).
[120] The price of selfish routing.
[61] Buffer overflow management in QoS switches.
[8] Almost optimal permutation routing on hypercubes.
[6] Online server allocation in a server farm via benefit task systems.
[10] Private approximation of NP-hard functions.
[9] Concurrent and resettable zero-knowledge in poly-loalgorithm rounds.
[41] Black-box concurrent zero-knowledge requires Omega~(log n) rounds.
[23] The round complexity of verifiable secret sharing and secure multicast.
[50] Communication preserving protocols for secure function evaluation.
[0] Some perspective on computational complexity (abstract).
[85] A sieve algorithm for the shortest lattice vector problem.
[79] Fast computation of low rank matrix.
[5] Complex tilings.
[32] Running time and program size for self-assembled squares.
[376] Algorithms, games, and the internet.
[4] Automata, circuits and hybrids: facets of continuous time.

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