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 40
Superlinear Quantum Query Lower Bounds for Subgraph Detection
Subgraph detection asks whether an $n$-vertex graph, accessed through queries to its adjacency matrix, contains a copy of a fixed graph $H$.Conditioning-Free Non-Uniform Quantum Fourier and Chebyshev Transforms
We present an efficient quantum algorithm for the non-uniform Chebyshev transform.Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM
In classical fine-grained complexity, the 3SUM Conjecture is used to prove a variety of conditional lower bounds on data structure and graph problems via an initial reduction to the SetDisjointness…Mixing FM-indexes and CSAs: backward search over an order-1 rank encoding
FM-indexes and compressed suffix arrays (CSAs) are often treated as interchangeable, but they behave differently as the alphabet grows.Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR Lemma
We give the first sublinear-time classical solvers for sparse semidefinite programs in the bounded-radius regime, without low-rank assumptions or Frobenius norm dependence on the constraint matrices.Exponential quantum speedup for $\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE
We study vector subset sum over $\mathbb{F}_3^n$: given $m$ random vectors from $\mathbb{F}_3^n$, find a nonempty subset that sums to zero; the smaller $m$, the more difficult it is to find such a…Gibbs Sampling in the Shattered Phase by Decoded Quantum Interferometry
We apply Decoded Quantum Interferometry (DQI) to sample from the Gibbs measures of classical Ising spin Hamiltonians.Faster Stable Numerical Polynomial Multiplication
In the preprint [vdH08], van der Hoeven considers the problem of multiplying two polynomials with floating-point coefficients, and give an algorithm to compute the product with small relative Newton…Dynamic Connectivity, Minimum Spanning Tree, and 2-Edge Connectivity with Polylogarithmic Worst-Case Update Time
We give fully dynamic algorithms for maintaining connectivity, minimum spanning tree, and $2$-edge connectivity of a graph with worst-case polylogarithmic update time.Unifying and Extending Strong Simulation of Quantum Circuits
We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits.Faster Algorithms for Finding Small Induced Patterns in Sparse Host Graphs
We study algorithms for detecting induced subgraphs corresponding to fixed pattern graphs in host graphs.Query-efficient winner prediction in district-based elections
In a district-based election, N voters are partitioned into k districts, and each voter votes for one of m candidates.The Power of Two-Choice Linear Probing
This paper considers the following basic question: If an (ordered) linear-probing hash table is allowed \emph{two} hash functions, instead of one, how does this change the expected insertion and…Degree Balance as a Fine-Grained Complexity Boundary for Quantum SAT
The local Hamiltonian problem is the canonical $\mathsf{QMA}$-complete problem, and $O(2^n)$ time classical algorithms and $O(2^{n/2})$ time quantum algorithms are known to solve the problem in the…On Extensions of the Unanimous Vote Problem
The Unanimous Vote problem is to determine a fixed order in which to flip each of $n$ biased coins, where each coin can be flipped only once, such that the expected number of flips until seeing both…Local Search for Fair Max-Min Diversification
Given $n$ points in a metric space, Max-Min diversification asks for a subset of $k$ points maximizing the minimum pairwise distance between the selected points.The Reach of Abelian Covers in Hypergraphs
Covers in hypergraphs are frequently studied to capture various forms of dependence between hyperedges.XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps
The Reduced Ordered Binary Decision Diagram (ROBDD) is a canonical representation of Boolean functions and is widely used in tasks such as equivalence checking and satisfiability checking of…Three-Color Free-Flood-It on Fixed-Height Grids Is Polynomial-Time Solvable
We give a deterministic algorithm for \textsc{Free-Flood-It} on rectangular grids $P_k\square P_n$ with at most three colors.Collision Detection is Instance $\widetilde{O}$ptimal Under the Birthday Threshold
Can structural knowledge about a hash function help accelerate the (black box) detection of collisions in it?