1: Efficient Centroid-Linkage Clustering
2: Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
3: A Simple and Optimal Sublinear Algorithm for Mean Estimation
4: The Invertibility of Cellular Automata with Menory: Correcting Errors and New Conclusions
5: A Little Aggression Goes a Long Way
6: MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
7: The Limits of Interval-Regulated Price Discrimination
8: Testably Learning Polynomial Threshold Functions
9: Optimal Preprocessing for Answering On-Line Product Queries
10: A bijection for the evolution of $B$-trees
11: Randomized Binary and Tree Search under Pressure
12: Fast Sampling Based Sketches for Tensors
13: Lookback Prophet Inequalities
14: Fast White-Box Adversarial Streaming Without a Random Oracle
15: Streaming Algorithms with Few State Changes
16: Optimal Electrical Oblivious Routing on Expanders
17: Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
18: Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
19: Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
20: A Unified Framework for Integer Programming Formulation of Graph Matching Problems
21: Efficient Parallel Multi-Hop Reasoning: A Scalable Approach for Knowledge Graph Analysis
22: A square root algorithm faster than Newton’s method for multiprecision numbers, using floating-point arithmetic
23: Approximating Optimum Online for Capacitated Resource Allocation
24: DPSW-Sketch: A Differentially Private Sketch Framework for Frequency Estimation over Sliding Windows (Technical Report)
25: Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems
26: Approximating Maximum Matching Requires Almost Quadratic Time
27: A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
28: Matching with Nested and Bundled Pandora Boxes
29: Roping in Uncertainty: Robustness and Regularization in Markov Games
30: The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations
31: Dynamic Correlation Clustering in Sublinear Update Time
32: Reducing the Space Used by the Sieve of Eratosthenes When Factoring
33: Optimal Kernel Orchestration for Tensor Programs with Korch
34: Compact Parallel Hash Tables on the GPU
35: Computing congruences of finite inverse semigroups
36: Efficient Discrepancy Testing for Learning with Distribution Shift
37: Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
38: Seat Arrangement Problems under B-utility and W-utility