1: Decoded Quantum Interferometry Under Noise
2: Spirals and Beyond: Competitive Plane Search with Multi-Speed Agents
3: Competitively Consistent Clustering
4: A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost
5: Dyadically resolving trinomials for fast modular arithmetic
6: Sampling tree-weighted partitions without sampling trees
7: Towards Efficient Hash Maps in Functional Array Languages
8: Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
9: A Tight Lower Bound for Doubling Spanners
10: Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
11: A Parameterized Perspective on Uniquely Restricted Matchings
12: Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
13: A Polylogarithmic Algorithm for Stochastic Online Sorting
14: jXBW: Fast Substructure Search in Large-Scale JSONL Datasets for Foundation Model Applications
15: Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
16: Group Fair Matchings using Convex Cost Functions
17: On computing and the complexity of computing higher-order $U$-statistics, exactly
18: r(star)-indexing
19: Multi-Metric Algorithmic Complexity: Beyond Asymptotic Analysis
20: On the complexity of constrained reconfiguration and motion planning
21: Weighted Partition Vertex and Edge Cover
22: Congested Clique Counting for Local Gibbs Distributions
23: A Perfectly Truthful Calibration Measure
24: A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
25: Tight Bounds for Sparsifying Random CSPs
26: On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
27: Concurrent Double-Ended Priority Queues
28: Online Stochastic Packing with General Correlations
29: Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
30: Finding subdigraphs in digraphs of bounded directed treewidth
31: Explainable Information Design
32: Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
33: Nearly Tight Bounds for the Online Sorting Problem
34: Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
35: Lagrangian Simulation Volume-Based Contour Tree Simplification
36: Improved Online Sorting
37: Compact representation of maximal palindromes
38: Properties of Egalitarian Sequences of Committees: Theory and Experiments
39: Auditable Shared Objects: From Registers to Synchronization Primitives
40: Incremental-Decremental Maximization
41: A $(4/3+\varepsilon)$-Approximation for Preemptive Scheduling with Batch Setup Times
42: TIME$[t] \subseteq {\rm SPACE}[O(\sqrt{t})]$ via Tree Height Compression
43: A Scalable Trie Building Algorithm for High-Throughput Phyloanalysis of Wafer-Scale Digital Evolution Experiments
44: Private Hyperparameter Tuning with Ex-Post Guarantee
45: Fermion-to-Fermion Low-Density Parity-Check Codes
46: Almost and Approximate EFX for Few Types of Agents
47: On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
48: Time-Optimal Directed q-Analysis