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 14
The Value of Experiments in Assortment Optimization
Retailers can learn customer preferences by experimenting with different assortments.Nearly-Optimal Time-Sample Trade-off in Consensus Dynamics
How does the number of sampled opinions affect the time required to reach consensus in distributed consensus dynamics?The Tight Competitive Ratio of Greedy for Online Steiner Forest
The online Steiner Forest problem is a fundamental network design problem in which terminal pairs arrive one at a time and an algorithm must irrevocably purchase edges connecting each pair.Minimum Label $k$-Cut on Planar Graphs: Complexity and Color Structure
Minimum Label $k$-Cut asks for a minimum-size set of colors such that deleting all edges of these colors leaves at least $k$ connected components.When Imputation Changes the Nearest Neighbor: Exact Certification of Similarity Retrieval for Incomplete Sensor Time Series
Sensor time series routinely reach similarity search with missing values, and the retrieved neighbours then depend on how the gaps were filled.Maximum Cardinality Matching in $n^{2+o(1)}$ Time
We consider the maximum cardinality matching problem in general graphs, and give an $n^{2+o(1)}$-time algorithm for the problem.Approximating Minimum Spanning Trees in Metrics under Semi-Random Corruptions
We study the problem of finding minimum spanning trees in semi-random corrupted metrics.On Zeros and Algorithms for Disordered Systems II: The Antiferromagnetic Ising Model up to Kesten-Stigum
We give the first polynomial-time algorithm to estimate the partition function of the antiferromagnetic Ising model on the uniformly random $d$-regular graph to arbitrarily high accuracy for all…Constant-Factor Approximation for Capacitated Clustering in Low Dimension with $(1+ε)k$ Centers
In many applications of $k$-median and $k$-means, including load balancing and redistricting, each center can serve only a bounded number of clients.Tight Lower Bounds for Distributional Paging
Distributional paging seeks a polynomial-time eviction rule that competes with the optimal \emph{online} policy $\mathrm{OPT}$ when requests come from a known stochastic source.Stochastic Minimum Spanning Tree Identification with Binary Weights
We introduce the Stochastic MST Identification Problem, with binary weights.Hypergraph cycle enumeration for efficient inference of planted k-XOR with smooth trade-off
We introduce hypergraph cycle enumeration (HCE), a simple spectral framework for detecting and recovering planted signals in noisy hypergraph inference problems.Omniprediction for All Mixable Proper Losses and Beyond
Omniprediction concerns the task of making predictions that are simultaneously accurate with respect to different losses.Faster #PPM from faster #3SAT
The counting variant (#PPM) of the permutation pattern matching (PPM) problem asks for the number of occurrences of a permutation pattern in a host permutation of length $n$.Output-Sensitive Enumeration of Maximal Closed Substrings in Linear Space
We revisit the output-sensitive enumeration of maximal closed substrings (MCSs).On Worst-Case Guarantees for Graph-Based Nearest-Neighbor Search
Graph-based nearest neighbor search algorithms like HNSW, DiskANN, NSG, and others have surged in popularity in recent years due to their excellent empirical performance in comparison to…Separations between $\#\mathrm{BIS}$ and $\#\mathrm{IS}$
We give complexity-theoretic separations between $\#\mathrm{BIS}$ and $\#\mathrm{IS}$.Fast Sparse $α$-Navigable Graph Construction with Improved Resource Augmentation
Graph-based nearest neighbor search methods, which run greedy search on a directed graph over the data points, have surged in popularity in recent years.Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part II: Langevin Dynamics
We consider the tensor principal components analysis (tensor PCA) problem on the sphere, in which we are asked to recover an unknown vector in $\mathcal{S}_N=\{x\in\mathbb{R}^N:\lVert x\rVert^2=N\}$…Optimal Encodings for Next/Previous Larger/Smaller Value Queries: A Unified Approach
Given a 1D array over a total order and a query position in the array, a next larger value query returns the nearest position to the right whose value is larger than the value at the query position.