1: Caching Connections in Matchings
2: Online Duet between Metric Embeddings and Minimum-Weight Perfect Matchings
3: Sorting from Crowdsourced Comparisons using Expert Verifications
4: Quantum-walk search in motion
5: Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
6: Listing 6-Cycles
7: ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
8: Probabilistic Counting in Generalized Turnstile Models
9: SpecTr: Fast Speculative Decoding via Optimal Transport
10: Sampling Balanced Forests of Grids in Polynomial Time
11: Optimal Structured Matrix Approximation for Robustness to Incomplete Biosequence Data
12: Fast multiplication of random dense matrices with fixed sparse matrices
13: Algebraic combinatorial optimization on the degree of determinants of noncommutative symbolic matrices
14: The Quantum Tortoise and the Classical Hare: A simple framework for understanding which problems quantum computing will accelerate (and which it will not)
15: Efficient Online String Matching through Linked Weak Factors
16: Linear MIM-width of the Square of Trees
17: Metric Clustering and MST with Strong and Weak Distance Oracles
18: Online Robust Mean Estimation
19: Fast Algorithms for Separable Linear Programs
20: Constructing disjoint Steiner trees in Sierpi'{n}ski graphs
21: $O(1/\varepsilon)$ is the answer in online weighted throughput maximization
22: Streamlining Knowledge Graph Construction with a fa\c{c}ade: The SPARQL Anything project
23: An Algorithm to Recover Shredded Random Matrices
24: Simple, Scalable and Effective Clustering via One-Dimensional Projections
25: Finding the saddlepoint faster than sorting
26: Robust Sparsification for Matroid Intersection with Applications
27: Core Challenge 2023: Solver and Graph Descriptions
28: Fully Dynamic $k$-Clustering in $\tilde O(k)$ Update Time
29: A hierarchy of eigencomputations for polynomial optimization on the sphere
30: A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
31: Simple Linear-Size Additive Emulators
32: Sketching and Streaming for Dictionary Compression
33: BitUP: Efficient Bitmap Data Storage Solution For User Profile
34: Experimental Evaluation of Fully Dynamic k-Means via Coresets
35: Fast and simple unrooted dynamic forests
36: Simple and Robust Dynamic Two-Dimensional Convex Hull
37: Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays
38: Adaptive Out-Orientations with Applications
39: Middle-mile optimization for next-day delivery
40: Structured Semidefinite Programming for Recovering Structured Preconditioners
41: On nonlinear compression costs: when Shannon meets R'enyi
42: A Novel Skip Orthogonal List for Dynamic Optimal Transport Problem
43: Efficient Parallelization of a Ubiquitous Sequential Computation