1: PtrHash: Minimal Perfect Hashing at RAM Throughput
2: Tight Bounds for some Classical Problems Parameterized by Cutwidth
3: Compression Barriers for Autoregressive Transformers
4: Towards Efficient Contrastive PAC Learning
5: Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees
6: The Parameterized Landscape of Labeled Graph Contractions
7: Testing whether a subgraph is convex or isometric
8: Assortment optimization given basket shopping behavior using the Ising model
9: Verifying Classification with Limited Disclosure
10: Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
11: Simultaneous Swap Regret Minimization via KL-Calibration
12: Worst-case Error Bounds for Online Learning of Smooth Functions
13: Improved Margin Generalization Bounds for Voting Classifiers
14: Planar Network Diversion
15: A Parameterized Complexity Analysis of Bounded Height Depth-first Search Trees
16: Potential-Based Greedy Matching for Dynamic Delivery Pooling
17: Efficiency in the Roommates Problem
18: Minimizers in Semi-Dynamic Strings
19: Tight Bounds on the Number of Closest Pairs in Vertical Slabs
20: Simple Sublinear Algorithms for $(\Delta+1)$ Vertex Coloring via Asymmetric Palette Sparsification
21: Optimal Approximate Matrix Multiplication over Sliding Window
22: An unconditional lower bound for the active-set method on the hypercube
23: Merge-width and First-Order Model Checking
24: Near-optimal Active Regression of Single-Index Models
25: A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
26: From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
27: Graph Inference with Effective Resistance Queries
28: Unbent Collections of Orthogonal Drawings
29: Learning sparse generalized linear models with binary outcomes via iterative hard thresholding
30: Towards Optimal Multi-draft Speculative Decoding
31: On Aggregation Queries over Predicted Nearest Neighbors
32: Optimal Approximate Matrix Multiplication over Sliding Windows
33: Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
34: Beyond Worst-Case Dimensionality Reduction for Sparse Vectors
35: Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
36: Differentially-private frugal estimation of quantiles
37: KeBaB: $k$-mer based breaking for finding super-maximal exact matches
38: A fast and slightly robust covariance estimator
39: Optimizing Quotient Filters using Graveyard Hashing
40: A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
41: Layered Graph Drawing with Few Gaps and Few Crossings
42: GridOT – a discrete optimal transport solver on grids
43: When MIS and Maximal Matching are Easy in the Congested Clique