1: Distance labeling schemes for trees
2: Stream Verification
3: A numerical analysis of Quicksort: How many cases are bad cases?
4: A bi-criteria approximation algorithm for $k$ Means
5: Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing
6: Approximation Algorithms for Generalized MST and TSP in Grid Clusters
7: The Bernstein Mechanism: Function Release under Differential Privacy
8: The Complexity of All-switches Strategy Improvement
9: A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability
10: Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover
11: Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
12: Fast clique minor generation in Chimera qubit connectivity graphs
13: Extension Complexity, MSO Logic, and Treewidth
14: Ascending-Price Algorithms for Unknown Markets
15: Parallel Correlation Clustering on Big Graphs
16: Probabilistic Polynomials and Hamming Nearest Neighbors
17: Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program
18: An algorithm for discrete fractional Hadamard transform
19: Solving Problems on Graphs of High Rank-Width
20: Meta-Kernelization using Well-Structured Modulators
21: A semidefinite program for unbalanced multisection in the stochastic block model
22: Global Convergence of Non-Convex Gradient Descent for Computing Matrix Squareroot