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 37
Optimal Convergence of Iterative Methods for Datalogo
$\mathsf{Datalog}^\circ$ has been introduced as an extension to Datalog that increases expressiveness, yet retains simple least fixpoint semantics and admits optimization techniques such as…Exact Optimal Transport by Matching
Balanced discrete optimal transport between n sources and n targets of unit mass is exactly the minimum-cost assignment problem-a bipartite perfect matching-and is therefore solvable exactly by…Sparsification Framework for Directed Densest Subgraph
We develop a new approach for computing approximate directed densest subgraphs (DDS).Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2
The finite group isomorphism problem asks whether two finite groups of order $N$ are isomorphic.A Faster Auction Algorithm for Weighted Matroid Intersection
We consider the weighted matroid intersection problem in the independence-oracle model.Best of Two Worlds: Combining High and Low Resolution to Compute Viewsheds on terrains
The viewshed of a point $v$ on a grid terrain $T$, viewshed$_T(v)$, is defined as the set of grid points in $T$ that are visible from $v$.Settling the Pass Complexity of Streaming Set Cover
In the streaming set cover problem, $m$ sets from a universe of size $n$ are arriving one by one in a stream, and the algorithm is allowed to process the stream using one or a few passes and a space…Coloring 3-colorable graphs with $O(n^{4/23})$ colors via a Gaussian-cover recursion
We give a randomized polynomial-time algorithm that colors any promised $3$-colorable graph on $n$ vertices with $\smash{O(n^{4/23}) = O(n^{0.17391\ldots})}$ colors, improving on the recent bounds…When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
Given a fixed set of pending deletion requests, retraining from scratch after each request is prohibitive, so a prescribed request-wise policy processes them sequentially.Factor Three Approximation for Edit Distance
We give randomized algorithms for $3$-approximate edit distance in $\widetilde{\mathcal{O}}(N^{11/6})$ time for unweighted edit distance and in $\widetilde{\mathcal{O}}(N^{40/21})$ time for…Robust Non-Clairvoyant Scheduling with Classification Models
We study the classical single-machine scheduling problem of minimizing the sum of completion times of jobs in a non-clairvoyant setting, where the processing time of each job remains unknown until…Stable and Online Algorithms for Random Matrix Discrepancy
We study the average-case matrix discrepancy problem: given independent normalized $d\times d$ Gaussian orthogonal ensemble matrices $A_1,\dots,A_N$ and a fixed margin $κ>0$, find signs…Exact Locality Gaps for Matchable Semi-Matchings
An assignment of tasks to servers can resist every small improvement and still make tasks wait longer than necessary.Safe Hypergraph Contraction via Capacity-Aware Repair Certificates
Multilevel partitioners shrink circuit hypergraphs through vertex contractions, yet a contraction that satisfies block capacity can still eliminate every optimal balanced bipartition.Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model
In this work, we study bipartiteness and expansion testing, two canonical problems in graph property testing in the bounded-degree model through the lens of quantum query complexity.Achieving Optimal Redundancy for Small Dynamic Rank/Select Dictionaries
In this paper, we study the number of bits required to construct a dynamic dictionary with optimal time for $\texttt{rank}/\texttt{select}$ operations.Exponential quantum advantages for decoded quantum interferometry in the streaming setting
Decoded quantum interferometry (DQI) is a polynomial-time quantum algorithm introduced by Jordan et al. (Nature 2025).Beating One Half for Online Bipartite Matching with Reusable Resources
We study online bipartite matching with unit-inventory reusable resources, where requests arrive in an adversarially fixed order, and each use of a resource makes it unavailable for an independent…Convergence of Kikuchi matrices to $Γ$-independent and $q$-Gaussian limits
Kikuchi matrices are a family of structured matrices that were introduced to study problems involving tensors and hypergraphs.Vertex-Failure Distance Oracles and Labeling Schemes: Compact and Constant-Approximate
We present new algorithms for the vertex-failure distance oracles and labeling schemes problems in undirected weighted graphs.