1: Improved Concentration Bounds for Count-Sketch
2: Can Quantum Communication Speed Up Distributed Computation?
3: Density Functions subject to a Co-Matroid Constraint
4: Optimal Multi-Dimensional Mechanism Design: Reducing Revenue to Welfare Maximization
5: Effective Computation of Immersion Obstructions for Unions of Graph Classes
6: Bin Packing/Covering with Delivery: Some variations, theoretical results and efficient offline algorithms
7: Beyond Max-Cut: \lambda-Extendible Properties Parameterized Above the Poljak-Turz'{i}k Bound
8: Approximating Minimum-Cost Connected T-Joins
9: The Cutting Plane Method is Polynomial for Perfect Matchings
10: Tight Analysis of Priority Queuing Policy for Egress Traffic
11: Achieving Approximate Soft Clustering in Data Streams
12: Mimicking Networks and Succinct Representations of Terminal Cuts
13: Low Rank Approximation and Regression in Input Sparsity Time
14: Adaptive sub-linear Fourier algorithms
15: On Mimicking Networks Representing Minimum Terminal Cuts
16: Efficient implementations of minimum-cost flow algorithms
17: Algorithms on Minimizing the Maximum Sensor Movement for Barrier Coverage of a Linear Domain
18: Sketch \star-metric: Comparing Data Streams via Sketching
19: Fast matrix multiplication using coherent configurations
20: Analysis of an exhaustive search algorithm in random graphs and the n^{c\log n} -asymptotics
21: A 2D Nearest-Neighbor Quantum Architecture for Factoring in Polylogarithmic Depth
22: Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances