1: SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
2: Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer
3: Analysis of Different Algorithmic Design Techniques for Seam Carving
4: Online Weighted Paging with Unknown Weights
5: Deterministic complexity analysis of Hermitian eigenproblems
6: Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
7: Learning the structure of any Hamiltonian from minimal assumptions
8: Improved Spectral Density Estimation via Explicit and Implicit Deflation
9: Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
10: Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
11: The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
12: Random zero sets with local growth guarantees
13: Beating Bellman’s Algorithm for Subset Sum
14: Sumsets, 3SUM, Subset Sum: Now for Real!
15: A Bellman-Ford algorithm for the path-length-weighted distance in graphs
16: Ideal Membership Problem for Boolean Minority and Dual Discriminator
17: Faster two-dimensional pattern matching with $k$ mismatches
18: Testing Identity of Distributions under Kolmogorov Distance in Polylogarithmic Space
19: A note on polynomial-time tolerant testing stabilizer states
20: I/O complexity and pebble games with partial computations
21: Approximately Counting Knapsack Solutions in Subquadratic Time
22: Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
23: Vertical Federated Learning with Missing Features During Training and Inference
24: Uniform Sampling of Negative Edge Weights in Shortest Path Networks
25: Erd\H{o}s-Gy'arf'as conjecture on graphs without long induced paths
26: Data subsampling for Poisson regression with pth-root-link
27: Sampling and counting triangle-free graphs near the critical density
28: Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
29: The Days On Days Off Scheduling Problem
30: An Algorithm for a Variation of the Shortest Common Superstring Problem
31: Statistical-Computational Trade-offs for Density Estimation
32: Deterministic counting from coupling independence
33: Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
34: Breaking the Bellman-Ford Shortest-Path Bound
35: An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
36: Coach Reservation for Groups Requests
37: All-Hops Shortest Paths
38: Anytime-Constrained Equilibria in Polynomial Time
39: Lightweight Near-Additive Spanners
40: Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time
41: Robust Sparse Regression with Non-Isotropic Designs
42: Interactive proofs for verifying (quantum) learning and testing