1: Outlier Robust Multivariate Polynomial Regression
2: BAT-LZ Out of Hell
3: Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
4: Efficient Detection of Exchangeable Factors in Factor Graphs
5: Lifted Causal Inference in Relational Domains
6: GreedyML: A Parallel Algorithm for Maximizing Submodular Functions
7: Scalable Algorithms for Individual Preference Stable Clustering
8: Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
9: Optimal Block-Level Draft Verification for Accelerating Speculative Decoding
10: Limits of Approximating the Median Treatment Effect
11: First Passage Percolation with Queried Hints
12: Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
13: Solving the Multiobjective Quasi-Clique Problem
14: On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
15: Barely Random Algorithms for Metrical Task Systems
16: A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
17: ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
18: Budget Recycling Differential Privacy
19: Perfect Zero-Knowledge PCPs for #P
20: Transfer Learning Beyond Bounded Density Ratios
21: PackIt! Gamified Rectangle Packing
22: Private graphon estimation via sum-of-squares
23: Revisiting Local Computation of PageRank: Simple and Optimal
24: Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
25: A Textbook Solution for Dynamic Strings
26: Resolving Sets in Temporal Graphs
27: How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
28: Agent-based Leader Election, MST, and Beyond
29: Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
30: Space-Efficient Indexes for Uncertain Strings
31: A Differentially Private Clustering Algorithm for Well-Clustered Graphs