1: De-amortizing Binary Search Trees
2: A Systematic Approach to Bound Factor-Revealing LPs and its Application to the Metric and Squared Metric Facility Location Problems
3: Tight Approximation of Image Matching
4: Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
5: Analysis of Thompson Sampling for the multi-armed bandit problem
6: An exact algorithm for the bottleneck 2-connected $k$-Steiner network problem in $L_p$ planes
7: A Flow-dependent Quadratic Steiner Tree Problem in the Euclidean Plane
8: Generic Multiplicative Methods for Implementing Machine Learning Algorithms on MapReduce
9: Representative sets and irrelevant vertices: New tools for kernelization
10: Space-Round Tradeoffs for MapReduce Computations
11: Eigenvector Synchronization, Graph Rigidity and the Molecule Problem
12: Testing the Connectivity of Networks
13: Optimal Lower and Upper Bounds for Representing Sequences
14: On the Practicality of Atomic MWMR Register Implementations
15: Privacy Auctions for Recommender Systems
16: Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
17: The tile assembly model is intrinsically universal
18: Diameter of Cayley graphs of permutation groups generated by transposition trees