1: On the Optimal Time/Space Tradeoff for Hash Tables
2: Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning
3: Optimal Sketching for Trace Estimation
4: Improved Algorithms for Low Rank Approximation from Sparsity
5: Online Edge Coloring via Tree Recurrences and Correlation Decay
6: Dynamic Distances in Hyperbolic Graphs
7: Mixed-Integer Programming for the ROADEF/EURO 2020 challenge
8: Minimax Optimization: The Case of Convex-Submodular
9: Finding the KT partition of a weighted graph in near-linear time
10: Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast
11: Provably efficient, succinct, and precise explanations
12: Competitive Algorithms for Online Weighted Bipartite Matching and its Variants
13: Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
14: Towards the 5/6-Density Conjecture of Pinwheel Scheduling
15: Improved Iteration Complexities for Overconstrained $p$-Norm Regression
16: Private Interdependent Valuations
17: Adaptive Massively Parallel Constant-round Tree Contraction
18: Probing to Minimize
19: Deterministic Approximation of Random Walks via Queries in Graphs of Unbounded Size
20: Deterministic Min-cut in Poly-logarithmic Max-flows
21: Approximate Gomory-Hu Tree Is Faster Than $n-1$ Max-Flows
22: The Algorithmic Complexity of Tree-Clique Width
23: Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle
24: Physarum Inspired Dynamics to Solve Semi-Definite Programs
25: The Parameterized Complexity of the Survivable Network Design Problem
26: Nearly Tight Lower Bounds for Succinct Range Minimum Query
27: An Improved Algorithm for The $k$-Dyck Edit Distance Problem
28: Augmenting Edge Connectivity via Isolating Cuts
29: HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances
30: Linear-time Minimization of Wheeler DFAs
31: Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union
32: A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs
33: Reallocation Problems with Minimum Completion Time
34: Minimum-Complexity Graph Simplification under Fr'echet-Like Distances
35: Universal Private Estimators
36: Finding All Leftmost Separators of Size $\leq k$
37: Average Sensitivity of Dynamic Programming
38: Compound Logics for Modification Problems
39: The Shortest Even Cycle Problem is Tractable
40: Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees
41: Computational thresholds for the fixed-magnetization Ising model
42: Optimal Mixing Time for the Ising Model in the Uniqueness Regime
43: Introduction to Coresets: Approximated Mean
44: Scaffolding Sets
45: Big-Step-Little-Step: Efficient Gradient Methods for Objectives with Multiple Scales
46: A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent
47: Single-Sample Prophet Inequalities via Greedy-Ordered Selection
48: Explainable k-means. Don’t be greedy, plant bigger trees!
49: On the Complexity of Dynamic Submodular Maximization
50: The Fourier Transform of Restrictions of Functions on the Slice
51: Breaking the $n^k$ Barrier for Minimum $k$-cut on Simple Graphs
52: Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities
53: Tight Bounds for Differentially Private Anonymized Histograms
54: Maintaining Exact Distances under Multiple Edge Failures
55: Fast Deterministic Fully Dynamic Distance Approximation
56: Flow-augmentation I: Directed graphs
57: Fast FPT-Approximation of Branchwidth
58: New Streaming Algorithms for High Dimensional EMD and MST
59: Optimal Approximate Distance Oracle for Planar Graphs
60: Approximately Efficient Bilateral Trade
61: Randomized Communication and Implicit Graph Representations
62: Metric Distortion Bounds for Randomized Social Choice
63: Algorithms and data structures for first-order logic with connectivity under vertex failures
64: A PTAS for Capacitated Vehicle Routing on Trees
65: Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
66: Frequency Estimation with One-Sided Error
67: Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios
68: Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds
69: $k$ disjoint $st$-paths activation in polynomial time
70: Simple Parallel Algorithms for Single-Site Dynamics
71: Fast sampling via spectral independence beyond bounded-degree graphs
72: Sampling from Log-Concave Distributions with Infinity-Distance Guarantees