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 36
Fair Diversity Maximization via Local Search
Diversity maximization is a fundamental optimization problem with applications in machine learning, data summarization, information retrieval, and recommendation systems.A Factor-5 Conversion to Internal Collage Systems
A collage system is a grammar-based compression model that extends straight-line programs with repetition and substring truncation.Quantum Submodular Maximization
We study the quantum query complexity of maximizing a non-negative submodular function, considering both the unconstrained setting and, for monotone functions, a cardinality constraint $k$ on an…Nearly optimal Personalized PageRank computation
We study the fundamental problem of computing Personalized PageRank (PPR) on an undirected and unweighted graph $G$.A Potential Function Analysis of Double Coverage for the $k$-Taxi Problem on Trees
We provide potential function proofs of the competitive ratios of DoubleCoverage for the hard $k$-taxi problem on HSTs and general weighted trees of bounded depth.A Shortest Augmenting Path Algorithm for Linear Matroid Parity
The matroid parity problem serves as a fundamental framework that generalizes both graph matching and matroid intersection.Hamiltonian locality testing and certification do not achieve the Heisenberg limit
We establish lower bounds for Hamiltonian property testing with access to the time-evolution operator but not its inverse.Monge matrix searching for lot sizing with piecewise-concave production costs
We study single-item lot sizing with piecewise-concave production and holding--backlog costs over $T$ periods.Hamiltonian Eigenvalue Transformation by Tridiagonal Gadgets
An analog device implements a local Hamiltonian H, but a polynomial P (H) is in general not local, so the device cannot implement it.The Plan Language of a Curriculum: A Formal Model and the Complexity of Degree Planning
We model an academic curriculum as a generator of a language of feasible study plans: prerequisites are monotone Boolean formulas in conjunctive normal form, degree requirements are credit-threshold…Grid Theory and Polynomiality in Dynamic Lot-Sizing
Why are some dynamic lot-sizing problems polynomial?Quantum algorithms for orthogonal polynomial transforms
A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states $\sum_k α_{k} \ket{k}$ coherently to a basis of normalized univariate…Faster Sublinear Maximal Independent Set Size
We give a sublinear-time algorithm for estimating the size of a maximal independent set in a graph using adjacency-query access with expected running time $\tilde{O}(n^{1+1/3})$, improving over the…Normal-Form Correlation in Markov Games
There has been a surge of recent work on correlated equilibrium concepts in Markov games.Single-Sample Prophet Inequalities: A Combinatorial to Single-Item Reduction
We study single-sample prophet inequalities for online combinatorial allocation.Quantum Simulation on Riemannian Manifolds
We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to…Network Speed Scaling with Competitive Ratios Independent of the Network
In network speed scaling, jobs arrive over time at a network of servers whose speeds can be tuned, every job must be processed by the servers along one of its allowed routes, and the goal is to…Vertex Cover Problem with Advice
We study the minimum Vertex Cover problem under two non-adaptive offline advice models, where predictions about a fixed optimum solution are provided once as part of the input.Conjunctive Queries with Negation: Beyond Signed-Acyclicity
We study constant-delay enumeration for conjunctive queries with negation ($\texttt{CQ}^{\neg}$).Geometry-Dependent Approximation for Non-Monotone $k$-Submodular Maximization
We study nonnegative, non-monotone $k$-submodular maximization with $k\ge2$ labels under support constraints, and show how the certified approximation coefficient improves as the support region…