1: Constructing Large Matchings via Query Access to a Maximal Matching Oracle
2: Quasi-polynomial-time algorithm for Independent Set in $P_t$-free graphs via shrinking the space of induced paths
3: On the Round Complexity of the Shuffle Model
4: Learning Deep ReLU Networks Is Fixed-Parameter Tractable
5: Oblivious Sampling Algorithms for Private Data Analysis
6: Montage: A General System for Buffered Durably Linearizable Data Structures
7: In-Order Sliding-Window Aggregation in Worst-Case Constant Time
8: How Do You Want Your Greedy: Simultaneous or Repeated?
9: On the mixing time of coordinate Hit-and-Run
10: Online Simple Knapsack with Reservation Costs
11: Clustering under Perturbation Stability in Near-Linear Time
12: Monochromatic Triangles, Intermediate Matrix Products, and Convolutions
13: Communication-Optimal Parallel Standard and Karatsuba Integer Multiplication in the Distributed Memory Model
14: Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs