1: Prophet Inequalities: Competing with the Top $\ell$ Items is Easy
2: Exact Trajectory Similarity Search With N-tree: An Efficient Metric Index for kNN and Range Queries
3: CarbonClipper: Optimal Algorithms for Carbon-Aware Spatiotemporal Workload Management
4: Coupling without Communication and Drafter-Invariant Speculative Decoding
5: Evolving A(star) to Efficiently Solve the k Shortest-Path Problem (Extended Version)
6: Palette Sparsification for Graphs with Sparse Neighborhoods
7: Kernelization for Orthogonality Dimension
8: Improved Approximation Algorithms for Index Coding
9: Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
10: Accelerating Spectral Clustering on Quantum and Analog Platforms
11: Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
12: More basis reduction for linear codes: backward reduction, BKZ, slide reduction, and more
13: A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
14: Online Matching with Delays and Size-based Costs
15: Quantum Algorithm for Jaccard Similarity
16: A Novel Quantum Algorithm for Efficient Attractor Search in Gene Regulatory Networks
17: Entropy Coding of Unordered Data Structures
18: Unbreakable Decomposition in Close-to-Linear Time
19: Parallel Sampling via Counting
20: Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
21: Pre-assignment problem for unique minimum vertex cover on bounded clique-width graphs
22: kendallknight: An R Package for Efficient Implementation of Kendall’s Correlation Coefficient Computation
23: Work-Efficient Parallel Counting via Sampling
24: Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates
25: Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
26: Improved Distance (Sensitivity) Oracles with Subquadratic Space
27: Eulerian Graph Sparsification by Effective Resistance Decomposition
28: Spectral Guarantees for Adversarial Streaming PCA
29: Revisiting Tree Canonization using polynomials
30: Almost Optimal Algorithms for Token Collision in Anonymous Networks
31: Characterization of Circular-arc Graphs: II. McConnell Flipping
32: Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
33: On the Advice Complexity of Online Matching on the Line
34: Approximately covering vertices by order-$5$ or longer paths
35: Parallel Algorithms for Median Consensus Clustering in Complex Networks
36: A Simple Dynamic Spanner via APSP
37: Bootstrapping Dynamic APSP via Sparsification
38: Scenario-Based Robust Optimization of Tree Structures
39: Private Counting of Distinct Elements in the Turnstile Model and Extensions