1: Systematic Alias Sampling: an efficient and low-variance way to sample from a discrete distribution
2: Comparison of Hyperplane Rounding for Max-Cut and Quantum Approximate Optimization Algorithm over Certain Regular Graph Families
3: The Role of Commitment in Optimal Stopping
4: Optimally revealing bits for rejection sampling
5: Forcing a unique minimum spanning tree and a unique shortest path
6: Simple in-place yet comparison-optimal Mergesort
7: Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
8: Algorithms and data structures for automatic precision estimation of neural networks
9: Accelerating Regression Tasks with Quantum Algorithms
10: Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
11: The Popular Dimension of Matchings
12: Designing Compact ILPs via Fast Witness Verification
13: A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
14: On Computing Top-$k$ Simple Shortest Paths from a Single Source
15: Private Learning of Littlestone Classes, Revisited