1: Faster Algorithms for Agnostically Learning Disjunctions and their Implications
2: On Learning Parallel Pancakes with Mostly Uniform Weights
3: Prize-Collecting Forest with Submodular Penalties: Improved Approximation
4: Adaptivity Gaps for Stochastic Probing with Subadditive Functions
5: On the Price of Differential Privacy for Hierarchical Clustering
6: Smooth Calibration and Decision Making
7: Quantum Speedup for Sampling Random Spanning Trees
8: Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
9: Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
10: A Mysterious Connection Between Tolerant Junta Testing and Agnostically Learning Conjunctions
11: A Theory of Spectral CSP Sparsification
12: Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
13: Linear Time Subsequence and Supersequence Regex Matching
14: Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
15: Universal Online Contention Resolution with Preselected Order
16: Fully Scalable MPC Algorithms for Euclidean k-Center
17: An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
18: Hardness of Median and Center in the Ulam Metric
19: Multiplicative Spanners in Minor-Free Graphs
20: Improved Streaming Edge Coloring
21: Estimating Random-Walk Probabilities in Directed Graphs
22: Streaming algorithms for products of probabilities
23: Sorting as Gradient Flow on the Permutohedron
24: From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
25: Traffic-Oblivious Multi-Commodity Flow Network Design
26: Graph modification of bounded size to minor-closed classes as fast as vertex deletion
27: Approximating Optimal Labelings for Temporal Connectivity
28: Identifying Approximate Minimizers under Stochastic Uncertainty
29: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
30: Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
31: Knapsack on Graphs with Relaxed Neighborhood Constraints
32: Simple Universally Optimal Dijkstra
33: Dynamic Approximate Maximum Matching in the Distributed Vertex Partition Model
34: Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP
35: Morphisms and BWT-run Sensitivity
36: Dynamic Membership for Regular Tree Languages
37: The Case for External Graph Sketching
38: Linear-Time Multilevel Graph Partitioning via Edge Sparsification
39: A general framework for finding diverse solutions via network flow and its applications
40: Pushing the frontiers of subexponential FPT time for Feedback Vertex Set
41: Online metric TSP
42: Realization of Temporally Connected Graphs Based on Degree Sequences
43: Fitting Tree Metrics and Ultrametrics in Data Streams