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 52
A State-Space Model of Figured-Bass Realization: Local Constraints, Coupled Voices, and Polynomial-Time Solvability
Figured-bass realization can be described as a sequence of choices constrained both within each sonority and between successive sonorities.High-Performance Tensor Formulation of the Viterbi Algorithm for Hidden Semi-Markov Models
Hidden Semi-Markov Models (HSMMs) are fundamental probabilistic models widely adopted across diverse domains, from computational biology to finance and signal processing.A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments
We nearly settle the polynomial-time approximability of the Directed Feedback Vertex Set problem in tournaments.The Price of Random Access: Measuring Block Granularity Across Four Compressed Formats
Random access into compressed data is normally bought with density.Equitable Partition Realizability for Dynamics-preserving and Privacy-aware Network Reconstruction
Degree-sequence realizability is the combinatorial basis of configuration models, but degree constraints alone do not ensure the preservation of graph dynamics.Improved Approximation for Unsplittable CVRP via a Greedy Approach
We devise a polynomial-time $3.159$-approximation algorithm for the metric unsplittable Capacitated Vehicle Routing Problem.Improved Regular Expression Matching with Simple Backreferences
A regular expression with backreferences (rewb) specifies a set of strings formed by characters combined with concatenation, union, star operators, and backreferences.High-Multiplicity Bin Packing is FPT
Bin packing asks whether a collection of items can be packed into at most a given number of bins of a given capacity.List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$
We give new bounds for list sizes of random linear codes at capacity, max loads of linear hash functions, and Furstenberg sets, over every finite field $\mathbb{F}_q$.Rank-One Matrix Discrepancy and Algorithmic Kadison--Singer
We give a deterministic polynomial-time algorithm that, given rational Hermitian matrices $H_1,\dots,H_N$ of rank at most one, finds signs $s\in\{\pm1\}^N$ with $\|\sum_i s_i H_i\|\le 13\|\sum_i…High Probability Streaming Lower Bounds for $F_2$ Estimation
Estimating the second frequency moment ($F_2$) of an underlying frequency vector is a fundamental problem in the streaming model.Online Allocation using Few Samples
We study online allocation problems where $n$ requests over $m$ resources arrive in an adversarial order and must be served immediately and irrevocably.The Classical Weisfeiler-Leman Algorithm Stabilizes in $O(n)$ Rounds
The classical Weisfeiler-Leman algorithm (also known as the $2$-dimensional Weisfeiler-Leman algorithm) is a simple combinatorial algorithm that was originally designed as a heuristic for the graph…PrecPack: An Efficient Open-Source Exact Solver for Bin Packing with Generalized Precedence Constraints
Efficient resource use in packing and assembly-line applications requires decisions that jointly account for capacity and precedence constraints.Pseudometric-Weighted Correlation Clustering via Spectral Preclustering
We study pseudometric-weighted correlation clustering, where every pair of vertices carries a nonnegative disagreement weight and the weights satisfy the triangle inequality.On testing the incentive compatibility of single-parameter allocation mechanisms
This paper is the first work at the intersection of game theory and property testing, giving algorithms and lower bounds for efficiently testing whether an allocation mechanism is incentive…Determinant maximization subject to a partition matroid constraint via stable distributions
Given vectors $v_i \in {\mathbb R}^d$, we consider the problem of choosing a set $I$ independent in a partition matroid in order to maximize the determinant $\det (\sum_{i \in I} v_i v_i^T)$.Stuffed IBLTs: Optimal Linear Multiset Sketches
A \emph{linear sketch} is a randomized linear mapping of a vector $v$ to a lower dimensional sketch vector, designed to preserve relevant information about $v$.Intrinsic-Dimensional Wasserstein Guarantees for Private Synthetic Measures
We study an $\varepsilon$-differentially private synthetic measure for $n$ points in $[0,1]^d$ by applying the existing PrivTree algorithm to construct an adaptive binary partition and then…Tight Lower Bounds for Differentially Private Continual Counting
The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its asymptotic optimality under pure differential privacy has remained unresolved since its…