1: Random Natural Gradient
2: A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching
3: Computing Approximate $\ell_p$ Sensitivities
4: Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
5: Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs
6: Improved Approximations for Ultrametric Violation Distance
7: Faster Maximal Exact Matches with Lazy LCP Evaluation
8: Simple and Asymptotically Optimal Online Bipartite Edge Coloring
9: Computing pivot-minors
10: On Mergable Coresets for Polytope Distance
11: Online Min Cost Circulation for Multi-Object Tracking on Fragments
12: Computing the $5$-Edge-Connected Components in Linear Time
13: Network Flow Problems with Electric Vehicles
14: Gaussian Differential Privacy on Riemannian Manifolds
15: Anytime-Constrained Reinforcement Learning
16: A near-optimal zero-free disk for the Ising model
17: Inference for Probabilistic Dependency Graphs
18: Compressed and Sparse Models for Non-Convex Decentralized Learning
19: An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio
20: Structural Parameterizations of Vertex Integrity
21: Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
22: Multiplying matrices using n arithmetic operations
23: A $(3+\epsilon)$-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds
24: Fast relaxation of the random field Ising dynamics
25: Parallel Algorithms for Equilevel Predicates
26: Better Sparsifiers for Directed Eulerian Graphs
27: A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
28: The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
29: On Algorithmic Cache Optimization
30: Generating Signed Permutations by Twisting Two-Sided Ribbons
31: Maximum Flow on Highly Dynamic Graphs
32: Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning
33: Differentially Private Approximate Pattern Matching
34: Finding planted cliques using Markov chain Monte Carlo
35: Fast and Space-Efficient Parallel Algorithms for Influence Maximization
36: Estimating the matrix $p \rightarrow q$ norm
37: Efficient Prior-Free Mechanisms for No-Regret Agents
38: A Primal-Dual Analysis of Monotone Submodular Maximization
39: Adaptive Search Optimization: Dynamic Algorithm Selection and Caching for Enhanced Database Performance
40: Optimal RIP Matrices with Slightly Less Randomness
41: ColorFloat: Constant space token coloring
42: Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems
43: An Algebraic Approach to the Longest Path Problem