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 43
Structure-Adaptive Tree Field Integrators
We present a new class of near-linear algorithms for efficiently integrating general tensor fields defined on trees with distance dependent kernels, the Structure-Adaptive Tree Field Integrators…Simpler Algorithms for Knapsack, Subset Sum, and Min-Plus Convolution
We simplify algorithms for Knapsack, output-sensitive Subset Sum, and near-convex min-plus convolution.Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Less Measurements
The support recovery problem in mixture of linear classifiers intends to identify which features actually matter when data is generated by a mixture of several linear decision rules.Tree Search With Distributional Predictions
Learning-augmented algorithms use machine-learned predictions to improve classical algorithmic guarantees when the predictions are accurate, while retaining rigorous performance guarantees when they…Single-or-Sample: Online Fair Allocation for Combinatorial Agents
We study the problem of fairly allocating $m$ indivisible goods among $n$ agents who arrive online, under the notion of maximin share (MMS) fairness.SparseDesign: Scaling Exact Coding-Sequence Design
Exact optimization of synonymous coding sequences under a joint folding-energy and codon-usage objective is limited by expensive dynamic-programming splits and large working sets…Stability Dichotomies for Boolean Constraint Satisfaction Problems
We study the stability of Boolean constraint satisfaction problems (CSPs) through the notion of average sensitivity (Varma and Yoshida, SODA 2021; SICOMP 2023).A 51-Addition Alternative-Basis Kernel for Rank-23 $3\times3$ Matrix Multiplication
We give a rank-23 algorithm for $3\times3$ matrix multiplication using 51 additions and subtractions in alternative bases.Differentially Private Approximation of the John Ellipsoid
We study the problem of approximating the John ellipsoid (JE) of a given (centrally symmetric) polytope of $n$ constraints in a Euclidean space under differential privacy (DP).Online Covering with Maximum Delay under Subadditive Service Costs
We study online covering in which each instantaneous service pays its purchase cost and one maximum waiting time, with no effect on future requests.Single-Exponential Algorithms for Directed Feedback Vertex Set on Planar Digraphs
We consider Directed Feedback Vertex Set on planar digraphs, parameterized by the solution size $k$.A data structure for quotient flag complexes
Vietoris-Rips filtrations, which are standard in topological data analysis, are flag complexes, and a simplex tree stores these without any attaching data.Near-Optimal Distributed Domination in Planar Graphs
We give a deterministic $(8+\varepsilon)$-approximation for minimum dominating set on planar graphs in a constant number of rounds of the LOCAL model, for every $\varepsilon>0$.Parity Tests under Ties: A One-Test Lifting Theorem
In the unrestricted polynomial decision-tree model, only the number of polynomial sign tests is charged.Unlocking Geodesic Gromov-Wasserstein Distances for 3D Modeling
\textit{Gromov-Wasserstein Distances} (GWDs) provide quantitative ways of comparing probabilistic distributions defined on different metric spaces by applying techniques from the optimal transport…Efficient Dynamic Algorithms for Graph Neural Networks with Non-Linear Propagation
Graph Neural Networks (GNNs) are widely used for representation learning on graphs, but most methods assume static topologies, making them inefficient on evolving networks where edges change over…Smooth Sailing through Spherical Shells: Provable Random-Lattice Sieving in Time $2^{0.292n}$
In an attempt to close the gap between the best provable and heuristic algorithms for hard lattice problems, such as the shortest (SVP) and closest vector problem (CVP), we analyze lattice sieving…Optimal Prophet Inequalities for Gain from Trade
We initiate the study of prophet trading, an online trading model in which a trader interacts with sellers and buyers who arrive in a uniformly random order and whose prices are drawn independently…An $n^{8/5+o(1)}$-Time $Ω(λ^3)$-Approximation for Longest Common Subsequence
Let $λ$ denote the ratio of the length of a longest common subsequence of two length-$n$ strings to $n$.Fast factorization in diagram monoids
We give explicit algorithms that factor elements of the standard diagram monoids into their usual generators.