Theory & Algorithms · Computer Science & AI
Data Structures & Algorithms
The newest papers in Data Structures & Algorithms that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
1,174 papers, from 4 September 2026 to 5 November 2026: 1,174 arXiv preprints.
Get the few papers worth your time in Data Structures & Algorithms every morning.
Follow Data Structures & Algorithms and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 34
Fine-Grained Hardness of Approximating Dynamic Time Warping
We prove conditional lower bounds for approximating dynamic time warping (DTW) over the uniform metric on three symbols.A faster matrix multiplication algorithm through structured optimization
We present a new asymptotic matrix multiplication construction yielding $ω<2.37115924$, and therefore an algorithm that multiplies two $n\times n$ matrices in $O(n^{2.37115924})$ arithmetic…Dijkstra Is NOT Greedy: A Global-to-Local Proof of Correctness
Dijkstra's algorithm is almost universally classified as a canonical greedy algorithm.Fast mixing of the SYK model at high temperatures
The Sachdev-Ye-Kitaev (SYK) model is a strongly interacting fermionic system.Near-Exact Computation of Independent Chip Model Placement Probabilities for Thousands of Players
The Independent Chip Model (ICM) converts the chip stacks of the players remaining in a poker tournament into finishing-place probabilities and prize equities.Improved Sublinear Algorithms for Maximal Independent Set and Metric Steiner Forest
In this work we consider the Maximal Independent Set (MIS) problem and the metric Steiner Forest problem in the sublinear time setting, under the adjacency/distance matrix query model.Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation
We consider a matching problem in which the cost of each edge is a vector with $k$ components.On the Parameterized Complexity of Conflict-Free Edge Cut in Undirected Graphs
In this paper, we study CONFLICT-FREE EDGE CUT (CF-CUT), which is a recently introduced conflict-free version of the MIN-CUT problem that asks to find the minimum number of edges to disconnect a…Hiding a Vertex from the Temporal Explorer: A Lower Bound for Degree-Bounded Temporal Graphs
A temporal graph is a sequence of graphs on a common set of $n$ vertices, its snapshots, one for each time step.Robust subspace designs and the power of a unique small quantum witness
The concept of subspace designs was introduced by Guruswami and Xing (STOC'13), and explicit constructions were given by Guruswami and Kopparty (FOCS'13).Sharp dimensional analysis of midpoint methods for Langevin sampling
We study deterministic and randomized midpoint discretizations of Langevin dynamics for a target $π\propto e^{-V}$, where $0 \prec αI\preceq\nabla^2V\preceqβI$ and $κ=β/α$.A Decremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Braess paradox originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges.A Uniform Algorithm for Strict NP on Bounded-Treedepth Graphs
A classical well-quasi-ordering result guarantees the existence of non-uniform linear-time algorithms for all problems in Strict NP on relational structures of bounded treedepth; however, this…Faster high-accuracy multicommodity flow in dense graphs
We give a fast algorithm for solving min-cost $k$-commodity flow.Optimal compression with quantum retrieval
We consider the following data compression problem.Near-Optimal Oracle Bounds for Isotropic Rounding
We give optimal bounds, up to polylogarithmic factors, for rounding convex bodies to near-isotropic position.An FPRAS for Counting Common Bases of Two Matroids
We design the first polynomial-time algorithms for approximately counting and almost uniformly sampling common bases of two matroids given by their independence oracles.Random Order in Quantum Streaming: Replenishment and Robust Lower Bounds
How can random order change the role of quantum memory in streaming?Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs
We give the first polynomial improvements over the textbook algorithms for $3$SUM and All-Pairs Shortest Paths (APSP): we show how to deterministically solve $3$SUM on $n$ integers of polynomial…Approximating Random Walks in $\widetilde{O}(\log n + \log^2 κ)$ Space for $κ$-Conditioned Graphs
For $κ>1$, a directed graph is $κ$-conditioned if it is $κ$-mixing and its stationary distribution is approximated by the uniform distribution within a factor of $κ$.