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 59
A Lower Bound of 21 for $3\times3$ Matrix Multiplication over $\mathbb{F}_2$
We prove that $3\times3$ matrix multiplication over $\mathbb{F}_2$ has bilinear complexity at least $21$, improving the previous lower bound of $20$.Improved Multilayered PCPs and Hypergraph Vertex Cover
We present two elementary constructions of multilayered PCPs that improve upon prior constructions in two ways.Don't Be Afraid to Die: Black Hole Search in Dynamic Graphs with Fewer Agents
We consider a team of synchronous mobile agents operating in a port-labeled network.Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction
We present the first polynomial lower bounds for several fundamental problems in the distributed graph sketching model in the tiny-error regime, which includes deterministic algorithms as a special…Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem
The constructive diagonal Ramsey problem asks, given adjacency-oracle access to an $N$-vertex graph, for a clique or independent set of the order guaranteed by Ramsey's theorem.Fast Evaluation of Polynomials with Rational Preprocessing
Horner's rule evaluates a monic degree-$n$ polynomial using $n-1$ multiplications.On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm
We consider the problem of approximately maximizing a weakly submodular function using the standard greedy algorithm, which is known to give tight approximation results for such functions under a…Algebraic Geometry Codes Approach the Half-Singleton Bound with Constant Field Size
We study linear codes for insertion and deletion (insdel) errors through the lens of evaluation codes.Online Matching in Convex Bipartite Graphs
Online resource-allocation systems, like outpatient scheduling and spectrum allocation, often assign sequentially arriving requests to an ordered pool of scarce resources, where each request accepts…Strategic Facility Location in Euclidean Spaces
The strategic facility location problem is defined as follows: $n$ agents report their location in a metric space, and the objective is to design a \emph{mechanism} deciding the (possibly…Machine Unlearning as Private Retroactive Algorithms
Machine unlearning typically aims to emulate retraining from scratch: upon a deletion request, the unlearning algorithm should produce an outcome that would have been obtained had the deleted point…Integrality Gap Bounds for the Goemans-Linial SDP on Finite Abelian Cayley Graphs
In the uniform sparsest cut problem we are asked to find a vertex set that cuts few edges relative to the number of vertex pairs it separates.Size-Sensitive Padded Decompositions for Faster Deterministic Negative-Weight Shortest Paths
We give a deterministic algorithm for single-source shortest paths in directed graphs with integral edge weights at least $-W$.Quantum lower bounds for convex optimization and real matrix-vector query problems
We (the author and the AI systems that did the heavy lifting) show that the quantum query complexity of minimizing a convex function over a convex subset of $\mathbb{R}^n$ with evaluation and…