1: Time-Optimal $k$-Server
2: Bridging Classical and Quantum String Matching: A Computational Reformulation of Bit-Parallelism
3: Graph parameters that are coarsely equivalent to path-length
4: On Almost Fair and Equitable Allocations of Indivisible Items for Non-monotone Valuations
5: Improving Merge Sort and Quick Sort Performance by Utilizing Alphadev’s Sorting Networks as Base Cases
6: Welfare Approximation in Additively Separable Hedonic Games
7: The connectivity carcass of a vertex subset in a graph: both odd and even case
8: Digital Zero-Noise Extrapolation with Quantum Circuit Unoptimization
9: Deterministically approximating the volume of a Kostka polytope
10: Detecting correlation efficiently in stochastic block models: breaking Otter’s threshold by counting decorated trees
11: The Computational Complexity of Positive Non-Clashing Teaching in Graphs
12: Faster and Space Efficient Indexing for Locality Sensitive Hashing
13: Combinatorial Optimization via LLM-driven Iterated Fine-tuning
14: Inverting Parameterized Burrows-Wheeler Transform
15: Encoding Schemes for Parallel In-Place Algorithms
16: Encoding Co-Lex Orders of Finite-State Automata in Linear Space
17: A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
18: Coreset Spectral Clustering
19: Geometric realizations of dichotomous ordinal graphs
20: Queueing, Predictions, and LLMs: Challenges and Open Problems
21: Counting with the quantum alternating operator ansatz
22: Algorithms for Distance Problems in Continuous Graphs
23: Sublinear Algorithms for Wasserstein and Total Variation Distances: Applications to Fairness and Privacy Auditing
24: Buffered Partially-Persistent External-Memory Search Trees
25: Dynamic DBSCAN with Euler Tour Sequences
26: Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection
27: On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
28: Improved Approximation Algorithms for Three-Dimensional Bin Packing
29: Duality between Lines and Points
30: Beyond 2-approximation for k-Center in Graphs
31: Bounding the Optimal Performance of Online Randomized Primal-Dual Methods
32: Revisiting Karp, Vazirani, and Vazirani (STOC 1990): A Simple Yet Rigorous Fix to the $1 - 1/e$ Upper-Bound Analysis
33: Achieving constant regret for dynamic matching via state-independent policies
34: Batch List-Decodable Linear Regression via Higher Moments
35: Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
36: Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
37: Solving Modular Linear Systems with a Constraint by parallel decomposition of the Smith form and extended Euclidean division modulo powers of primes divisors
38: MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
39: Super-Linear Speedup by Generalizing Runtime Repeated Recursion Unfolding in Prolog
40: An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
41: Towards Transitive-free Digraphs
42: Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
43: A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
44: Approximating the Total Variation Distance between Gaussians
45: Discrete Effort Distribution via Regrettable Greedy Algorithm
46: A Quantum Algorithm for the Classification of Patterns of Boolean Functions