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 38
A computational phase diagram for the transverse field Ising model
We study the transverse field Ising model, defined by the Hamiltonian $H =\frac{1}{2}\sum_{i, j\in [n]} J_{ij} Z_i Z_j +\sum_{i=1}^n h_i^z Z_i + η\sum_{i} X_i$ where $J $ is the symmetric…Quantum state preparation for weighted d-DNNF
The quantum state preparation problem is to, given a description of a quantum state, efficiently generate a quantum circuit computing the state.Randomized Matvec Lower Bounds for Simplex-Based Matrix Games
We prove randomized matrix-vector query lower bounds for two normalized matrix-game geometries: a Euclidean unit ball against a probability simplex, with row norms at most one, and two probability…Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes
We study linear programming (LP) representations and strongly polynomial algorithms for robust Markov decision processes (RMDPs) with rational polyhedral state-action rectangular uncertainty in…A provable quantum advantage for approximate optimization via decoded quantum interferometry
Decoded quantum interferometry (DQI) is a novel paradigm for tackling approximate optimization problems on quantum computers.Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
We give a deterministic classical algorithm that estimates $|\langle x|U|0^n\rangle|^2$ to additive error $\varepsilon$ in $\mathrm{poly}(n, 1/\varepsilon)$ time, where $U$ is a constant-depth…Polynomial-time classical and quantum simulation of quantum impurity models
Quantum impurity models are paradigmatic models of interacting quantum matter, as well as key computational primitives for modern electronic-structure methods.Simple analysis of an algorithm for multiple-source shortest paths in planar graphs
This paper addresses the following problem: given a planar embedding graph, compute a representation of the shortest-path trees rooted at all the boundary nodes of the graph.Fine-Grained Analysis of SIMD-Based Hash Table Implementations
In recent years, several variants of classical hash table schemes have been developed by engineers in order to take advantage of the processor's internal parallelism using SIMD instructions, which…Job Scheduling with Battery Recharging Constraints
A battery-powered device, such as a delivery drone that works from a depot, must stop to recharge between jobs, and the time spent recharging delays every job that follows.The Power of Flexible Budgets in Adwords
Search advertising platforms routinely spend beyond an advertiser's average daily budget on high-traffic days, so long as total spending over the month stays within the monthly budget.Auction-Based Algorithms for Matroid Intersection: Near-Linear Query Complexity and Constant-Pass Semi-Streaming
In this paper, we develop a new auction-based framework for matroid intersection and use it to obtain improved approximation algorithms in several computational settings.Faster network motif discovery by counting isomorphic subtrees
We develop a new algorithm for counting the number of subgraphs of a network isomorphic to a given query graph (#SubgraphIsomorphism), motivated by network motif search.High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction
We study the problem of sampling from a continuous density $π\propto \exp(-V)$ on $\mathbb R^d$, where $V\in C^2(\mathbb R^d)$ has a $β$-Lipschitz gradient and $π$ satisfies a logarithmic Sobolev…Local decisions, diffusive influence, and lower bounds for graphical balanced allocation
In graphical two-choice allocation, each arriving ball is assigned to one endpoint of a random edge.Quantum Query Complexity for List Search
Searching in a linked list is one of the most basic problems in classical algorithms.Optimal VC Dimension of Contrastive Learning with Margin
Contrastive learning is a successful paradigm for learning $d$-dimensional geometric representations from a collection of ``anchor--positive--negative'' triplets $(i,j^{+},k^{-})$, indicating that…Provable Classical and Quantum Local Algorithms for Max-$k$-Cut and Quantum Advantage at Moderate Girth
Broadening the study of quantum optimization algorithms from binary to $k$-element alphabets has been shown to open new avenues for potential quantum advantage.A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees
We study the \emph{online transportation problem}, in which $n$ requests arriving sequentially in a metric space must be irrevocably assigned to $k$ capacitated facilities.Breaking the $2^n$ barrier for directed hamiltonicity
We give a randomized algorithm for Directed Hamiltonian Cycle on $n$-vertex directed graphs that runs in time $O^*((375/196)^n)=O^*(1.9133^n)$.