Set constraints with projections.
An axiomatic approach to personalized ranking systems.
Tight failure detection bounds on atomic object implementations.
Routing betweenness centrality.
Finding a maximum matching in a sparse random graph in
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors.
Ultra-low-dimensional embeddings for doubling metrics.