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 35
Polynomial-time classical algorithms for mean-field models up to the glass transition
The Sachdev-Ye-Kitaev model is a strongly interacting fermionic system that has been well-studied in condensed matter and high energy physics.Quantum 1-PCA with Pauli Measurements in Nearly Linear Time
We consider the problem of quantum 1-PCA: given copies of an unknown $n$-qubit mixed state, recover a classical description of its leading eigenvector.Finding Gaussian Structure in Bosonic States
We study agnostic tomography of pure bosonic Gaussian states: given copies of an arbitrary $n$-mode bosonic state $ρ$, the goal is to output a pure Gaussian state whose infidelity with $ρ$ is at…CV-QAOA: Efficient Low-Depth Quantum Optimization of Continuous Variables
We study a Continuous-Variable Quantum Approximate Optimization Algorithm (CV-QAOA) for high-dimensional continuous optimization.Tarski Fixed Points in Quasi-FPT Queries
We study the query complexity of finding a Tarski fixed point over $[n]^k$.Sample-Optimal Estimation of the Fréchet Inception Distance
The Fréchet Inception Distance (FID) is widely used to evaluate generative models, but its empirical plug-in estimator suffers from finite-sample bias [BSAG18, CF20].Trading with the STARS: Algorithm Design & Spectrum of Fundamental Limits for Trading with Storage
We study an online trading problem where a trader, given a sequence of i.i.d. prices drawn from a known distribution $F$ on $[0,1]$, must make irrevocable buy, sell, or hold decisions subject to…Byzantine-Tolerant Causal Unicast with Constant Message Space Overhead
Causal message ordering provides essential semantics for distributed applications, yet ensuring it within an asynchronous system subject to Byzantine failures presents fundamental theoretical and…Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint
Maximizing a submodular function subject to a matroid constraint is a cornerstone problem in combinatorial optimization.Cores Characterize the One-Pass Streaming Complexity of CSPs
We study the one-pass streaming complexity of CSPs over a fixed finite relation $R$ under three natural objectives: $\textsf{SAT}(R)$, deciding whether all constraints can be satisfied…A Tardos-Type Algorithm for Separable Convex Quadratic Programming
We give an exact algorithm for continuous separable convex quadratic programming with an integer equality matrix and nonnegative variables.Almost-Linear Decremental Single-Source Distance Estimates in Directed Graphs via Cut Balance
We give a deterministic reduction for maintaining simultaneous approximate single-source distance estimates in online decremental directed graphs.W[1]-Hardness of Upper Clique Transversal
A clique transversal of a graph is a set of vertices intersecting every maximal clique.Improved Upper and Lower Bounds for Quantum Convex-Body Volume Estimation
Estimating the volume of a high-dimensional convex body is a fundamental problem in theoretical computer science.Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation
A kernel $k(x,y)$ is LSHable if there exists a locality sensitive hashing scheme $H$ such that $k(x,y)=\Pr_{h\sim H}[h(x)=h(y)]$ for all $x,y$.Multilevel Dynamic Thinning for Matroid Secretary
In the matroid secretary problem, weighted elements arrive in random order, and an online algorithm must irrevocably accept elements forming a high-weight independent set.CT-Miner: Fast and Coarse-Grained Time-Series Pattern Mining via Cartesian Trees
Time series often contain recurring structural patterns, and efficiently mining such patterns into compact representations is essential for scalable analysis of long sequences.Guanaco: A Global-Uniformity Algorithm for Near-Submodular-Width Conjunctive Query Evaluation
We present Guanaco, an algorithm for performing conjunctive query evaluation where, for each Boolean conjunctive query, and positive epsilon, the algorithm achieves polynomial time with exponent…The Infectious Vaccination Problem: a variant of Firefighting with Spreading Defence
The Firefighter Problem models a spreading process (originally a fire, alternatively an infection or rumour, for example) on a graph.Prime factorisation of stable-matching instances: uniqueness, simultaneous products, and an exact census
Every balanced instance of the stable marriage problem with strict complete preferences has a unique finest partition into prime blocks, and that single partition simultaneously factors three…