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 47
An Exposition of GPT Astra's Proof of Lower Bound on DP Continual Counting
The goal of this note is to give a detailed proof, to the best of our understanding, of the recent presentation by Harrison and Leeman (arXiv:2609.17650v01 and arXiv:2609.17650v02) of the proof by…High-Dimensional Ultra-Log-Concave Distributions
Ultra-log-concave distributions are ubiquitous in probability, combinatorics, and statistical mechanics and have been studied extensively.Byzantine Causal Reliable Broadcast (BCRB) with Constant-Size Message Metadata
Asynchronous Byzantine Reliable Broadcast (BRB) is a fundamental primitive that guarantees agreement and validity in distributed systems subject to Byzantine faults, but it lacks ordering guarantees.On Deterministically Computing Total Variation Distance via Zonotope Compression
We study deterministic relative approximation of the total variation distance between high-dimensional distributions given by succinct descriptions.Witness Set in Weak Visibility Polygons is Polynomial-Time Solvable
In the classical Art Gallery Problem (AGP), guards are placed in a polygon so that together they see every point.Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids
Over the past decade, a growing body of research has shown that $γ$-weak submodularity broadly arises in numerous subset selection tasks, including feature selection, neural network pruning, and…Vertex Cover Interdiction in Bipartite Graphs
In the vertex cover interdiction problem, we are given an undirected graph $G=(V,E)$, two integers $t$ and $k$ and a vertex subset $B\subseteq V$, and we are asked to find a set $X \subseteq B$ with…Clique-dependent strongly sublinear treewidth and strongly sublinear tree-independence number
We establish a strongly sublinear counterpart of a recent result of Chudnovsky, E S, and Lokshtanov (arXiv 2025) on treewidth and tree-independence number.An Incremental Algorithm for Checking the Possibility of Braess Paradox in Dynamic Nets
Braess paradox is a well-known phenomenon that originates when latency at Wardrop equilibrium in traffic networks decreases because of removing edges.Improved polynomial-time algorithms for detecting and recovering planted $Θ(\sqrt{n})$-cliques
In the planted clique problem, one observes either an Erdős--Rényi graph on $n$ vertices or such a graph with a clique added to $k = k(n)$ vertices, and seeks to detect or recover the clique.FPT Isomorphism Test for $F$-Free Tournaments
We show that isomorphism of $F$-free tournaments can be solved in FPT time $f(k) \cdot n^{O(1)}$, where $k$ denotes the size of $F$, and $n$ denotes the size of the input tournaments.Parameter-Free Triangle Counting
Given an undirected, unweighted graph $G = (V,E)$ with $n$ vertices and $m$ edges, the triangle counting problem seeks the number of three-cycles in it.A Proof of the Most Informative Boolean Function Conjecture
Let $X$ be uniform on $\{-1,1\}^n$, let $Y$ be obtained by passing its coordinates independently through a binary symmetric channel with crossover probability $p$, and let $g:\{-1,1\}^n\to\{0,1\}$…The Facility Advantage in the One-Round Discrete Voronoi Game on a Line
In the one-round discrete Voronoi game a multiset $V$ of $n$ voters on a line is given; player P places $k$ facilities, player Q then places $\ell$, and each voter is won by the nearer facility…Approximating Prize-Collecting TSP below 1.556
The prize-collecting traveling salesperson problem is a variant of the metric traveling salesperson problem in which vertices may be left unvisited by paying their associated penalties.On the Offline Version of the Time-Optimal k-Server Problem
We consider the offline problem of parallel relocation of k identical mobile resources.Near-Optimal Online Metric Matching on $Δ$-ary HST
In the online metric matching problem, we have $n$ servers with known locations in some metric space.On the generation of multiplicative groups by small primes
Motivated by a question of Regev arising from his improved quantum factoring algorithm, we study how many small primes are needed to generate the group $({\mathbb Z}/q{\mathbb Z})^\times$ when each…An Approximation Algorithm for Non-uniform Non-contiguous Translocation Distance
Translocations are genome rearrangement operations that exchange prefixes of two chromosomes.Sharper Bounds for the Complex Grothendieck Constant
We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant.