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 50
Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
In previous papers, we began the study of sequence prediction algorithms adapted to stringological word complexity measures.Counting Triangles in Graph Streams with Repeatable and Forgettable Edges
Most existing graph streaming algorithms assume the ideal scenario where each edge arrives only once.Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
Computing influence spread under the Independent Cascade (IC) model is #P-hard, and influence maximization is commonly approached using Monte Carlo or reverse-reachable-set sampling.Integrality gap preserving reductions
We propose a framework for the systematic study of integrality gaps of combinatorial optimization problems with respect to a fixed linear programming formulation.Emergency Vertex Cover
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to at least one…Optimal Simulated Annealing for Partition Function Estimation
In this note, we give a simple analysis of a non-adaptive simulated annealing algorithm for estimating the partition function of Gibbs distributions.Parallelism, critical windows, and separations among diffusion language models
A popular selling point of diffusion large language models (dLLMs) is their capacity for parallelism: the ability to generate sequences of text far more efficiently than autoregressive models, which…An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover
We show an information-theoretic lower bound of $Ω\left(\frac{\log n \log m}{\log \log n + \log \log m}\right)$ for online set cover against randomized algorithms, for all sufficiently large $m$ and…Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
We consider a large-scale incentive allocation problem where the entire trade-off curve between budget and profit has to be maintained approximately at all times.Fast FPRAS for the Permanent
We give an FPRAS for the permanent of an $n\times n$ $0/1$ matrix with running time $\widetilde{O}(n^{3.5}\varepsilon^{-2})$.Metric Weighted Edit Distance: $(3+\varepsilon)$-Approximation in $\widetilde O_\varepsilon(N^{1.6})$ Time
For every $0 < \varepsilon \le 1$, we give a randomized $(3+\varepsilon)$-approximation to weighted edit distance when the costs form a metric on the alphabet augmented with a gap symbol.The Strong Secretary Conjecture is True for Linear Matroids
We prove a $1/e$ guarantee for the matroid secretary problem on linear matroids, therefore settling the strong secretary conjecture in this class of matroids.Target-Stratified Fair Range Summaries: Improved Fair $\varepsilon$-Nets and Geometric Hitting Sets
Compact summaries are a key tool for approximate query processing over large datasets.Prophet Inequalities and Online Contention Resolution for Matchoids
In the classical prophet inequality, an algorithm observes a sequence of random variables with known distributions in an online fashion, and it must select one of the random variables with the goal…Scaling Forced Alignment to End-User Devices
The Viterbi algorithm has been previously used to perform forced alignment of audio to text to mine training data from online resources.A quantitative tree-likeness bound from average hyperbolicity
Chatterjee and Sloman proved that a bounded measurable similarity function with sufficiently small average Gromov hyperbolicity admits a tree representation with small mean approximation error.Systematic Data Structure Lower Bounds via the Query-with-Sketch Model
We study data structure lower bounds for the Approximate Matrix Powering (AMP) problem.Serial-batch scheduling to minimise the total weighted late work
We study the problem of scheduling jobs on a serial-batch machine with the aim of minimising the total weighted late work.Efficient Algorithms for Subdeterminant Maximization under Partition Matroids
We consider the determinant maximization problem under partition constraints: Given an $n\times n$ PSD matrix A and a partition matroid $M$ on $[n]$, find a base $S$ of $M$ that maximizes…Hidden Circuits and Exact Counting in Ordered Graphs
We prove that counting perfect matchings is $\#P$-complete under polynomial-time Turing reductions on each of three classes of simple, unweighted graphs: monotone graphs, unit interval graphs, and…