1: Fairmandering: A column generation heuristic for fairness-optimized political districting
2: Approximate Equivalence Checking of Noisy Quantum Circuits
3: From Coupling to Spectral Independence and Blackbox Comparison with the Down-Up Walk
4: Space Lower Bounds for Approximating Maximum Matching in the Edge Arrival Model
5: Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$
6: Quantum walk-based search algorithms with multiple marked vertices
7: Facility Reallocation on the Line
8: Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Global Connectivity Problems
9: Online Stochastic Matching, Poisson Arrivals, and the Natural Linear Program
10: Single-Sample Prophet Inequalities Revisited
11: The Complexity of Dependency Detection and Discovery in Relational Databases
12: Why Do Local Methods Solve Nonconvex Problems?
13: ButterFly BFS – An Efficient Communication Pattern for Multi Node Traversals
14: Differentially Private Normalizing Flows for Privacy-Preserving Density Estimation
15: Classification of Local Problems on Paths from the Perspective of Descriptive Combinatorics
16: Testing identity of collections of quantum states: sample complexity analysis