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 39
MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One
We present \emph{multitable} and its Rust reference implementation: a stable hash table both materially faster at equal physical memory and more flexible than the SwissTable in its Rust's hashbrown…Polynomial-time algorithm for exact $(1,2)$-center problem under continuous Fréchet distance
In this paper, we explore the $(1,2)$-center problem for polygonal curves under continuous Fréchet distance.Multidimensional Resource Scheduling with Small Demands
We study multidimensional resource scheduling.A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General Graphs
Quantum speed-ups have been obtained for many fundamental graph problems, including most variants of matching.Consensus for Compressed Static Functions
The Consensus technique marked a breakthrough in the construction of minimal perfect hash functions (MPHFs), reaching a linear tradeoff between construction time and space overhead relative to the…$(α, β)$ Spanners and Hybrid Spanners with Nearly Tight Bounds
For an $n$-vertex undirected, unweighted graph $G=(V,E)$ and a positive integer $k$, we present new spanner constructions with $O_k(n^{1+1/k})$ edges that achieve nearly optimal guarantees for all…Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle
We prove that, for every fixed nonempty graph $H$, induced-$H$-freeness is testable with $\varepsilon^{-O_H(1)}$ queries on outerplanar graphs with no maximum-degree bound in the…Connected Dominating Set on Semi-Ladder-Free Graphs
We study \textsc{Connected Dominating Set} on graphs whose closed-neighborhood set systems are $d$-semi-ladder-free.Learning Random Quantum Circuits and the Emergence of Pseudorandomness
We give an efficient algorithm for learning $k$-dimensional brickwork random quantum circuits using only copies of the output state obtained by applying $U$ to the all-zero input.Verifiable quantum advantage based on polynomials with planted structures
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also verifiable just…Component-Weighted Centroid Search for Exact Incremental BPE
Exact incremental BPE maintains the canonical tokenization state after every appended byte.Robust and Learned Online Matching in Growing Trees
We study irrevocable maximum-cardinality matching in trees revealed by successive leaf attachments, with a known horizon and an exogenous growth law that is misspecified or unknown.Super-Quadratic Quantum Speedups for Combinatorial Optimization via Tilted Walks
We introduce quantum tilted walks, a quantum algorithmic framework for solving exact combinatorial optimization problems.Sharper Gaussian Covers in the Bansal--Huang--Lee Coloring Framework
Bansal, Huang, and Lee recently gave a polynomial-time algorithm that colors every $3$-colorable graph on $n$ vertices with $O(n^{0.19539})$ colors.Policy Iteration Is Not Strongly Polynomial for Deterministic Markov Decision Processes: The Price of Algorithmic Anarchy
We establish an exponential iteration lower bound in the number of states for Howard's policy iteration on deterministic discounted Markov decision processes, with at most two actions per state.Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits
We introduce shadow quantum singular value transformation (Shadow QSVT): given an initial state $|ψ\rangle$, a Hermitian matrix $H$, a polynomial $f$, and a set of observables $\{O_1,\dots,O_m\}$…Improved Quantum Query Bounds for Boolean Matrix Product Verification
We prove the first non-trivial upper bound for the quantum query complexity of Boolean Matrix Product Verification ($\mathsf{BMPV}$), answering a longstanding open question in quantum query…Improved quantum volume estimation with transducers and amortized quantum walks
The volume estimation problem is a classic task in computational geometry.Dynamic Time Warping in the Low-Distance Regime
Dynamic Time Warping (DTW) is a classical similarity measure for strings and time series that allows local stretching.Quantum oblique eigenprojection
Every square matrix decomposes its underlying Hilbert space into generalized, nonorthogonal eigensubspaces.