1: Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
2: A faster heuristic for the Traveling Salesman Problem with Drone
3: Warm-starting Push-Relabel
4: Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
5: GIST: Greedy Independent Set Thresholding for Diverse Data Summarization
6: An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
7: Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
8: Theoretical insights and an experimental comparison of tango trees and multi-splay trees
9: The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
10: On the formalization of the notion of an interactive algorithm
11: Construction of a Byzantine Linearizable SWMR Atomic Register from SWSR Atomic Registers
12: Fast Gaussian Distributed Pseudorandom Number Generation in Java via the Ziggurat Algorithm
13: MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encodings
14: SimiSketch: Efficiently Estimating Similarity of streaming Multisets
15: Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
16: Consistent Submodular Maximization
17: Accelerating Lattice QCD Simulations using GPUs
18: Quantum generalizations of Glauber and Metropolis dynamics
19: Private Mean Estimation with Person-Level Differential Privacy
20: OpenTensor: Reproducing Faster Matrix Multiplication Discovering Algorithms
21: Optimally Improving Cooperative Learning in a Social Setting
22: Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
23: Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm