1: Parameterization of tensor network contraction
2: Balancing spreads of influence in a social network
3: Fast Algorithm for K-Truss Discovery on Public-Private Graphs
4: Multi-reference factor analysis: low-rank covariance estimation under unknown translations
5: On the Efficiency of Entropic Regularized Algorithms for Optimal Transport
6: On Atomic Registers and Randomized Consensus in M&M Systems
7: Sample-Optimal Low-Rank Approximation of Distance Matrices
8: The Number of Minimum $k$-Cuts: Improving the Karger-Stein Bound
9: Noise reduction using past causal cones in variational quantum algorithms
10: On the Use of Randomness in Local Distributed Graph Algorithms
11: Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
12: A Direct $\tilde{O}(1/\epsilon)$ Iteration Parallel Algorithm for Optimal Transport
13: Rpair: Rescaling RePair with Rsync
14: Cores and Other Dense Structures in Complex Networks
15: On Romeo and Juliet Problems: Minimizing Distance-to-Sight
16: Correlation decay and partition function zeros: Algorithms and phase transitions
17: Counting independent sets in unbalanced bipartite graphs
18: Scalable Spatial Scan Statistics for Trajectories
19: Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
20: Distributed Weighted Matching via Randomized Composable Coresets
21: Data preprocessing to mitigate bias: A maximum entropy based approach
22: The Problem of Dynamic Programming on a Quantum Computer
23: A Note on Submodular Maximization over Independence Systems
24: Near Neighbor: Who is the Fairest of Them All?
25: Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation
26: Optimal algebraic Breadth-First Search for sparse graphs