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 58
Maximum Matching-Match: Hardness and Approximation
In this paper, we study \textsc{MaxMMP}, an optimization variant of the Matching-Match Puzzle introduced by Iburi and Uehara (FUN 2024).Dasgupta's Hierarchical Clustering Objective: Geometry and the Price of the Cardinality Constraint
The cost of a hierarchical clustering can be represented by an ultrametric whose lowest-common-ancestor labels are cluster cardinalities.The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions
Given a graph $G=(V,E)$, let $S$ ($\subseteq V$) be a set of vertices.Better Late Than Never: Online Flow Time Scheduling with Online Estimates
In the classical online flow-time scheduling problem on a single machine, jobs arrive over time and must be processed to minimize the total time they spend in the system: for over fifty years, we…Algorithms for Finite Group Epimorphism Testing
The Group Epimorphism Problem (GpEpi) asks, given two finite groups $G_1$ and $G_2$, whether there exists a surjective group homomorphism, or epimorphism, from $G_1$ to $G_2$.Parallelizing the Factorial Space: 3x SIMD Acceleration of the Steinhaus-Johnson-Trotter Algorithm via Dual-Lane AVX2 Execution
This paper presents a high-performance SIMD acceleration framework for the Steinhaus-Johnson-Trotter permutation generation algorithm, targeted at modern x86-64 architectures using the AVX2…Improved Upper Bounds for Dynamic Bin Packing of General, Unit-Fraction, and Power-Fraction Squares
This paper presents significant upper-bound improvements for dynamic 2D square bin packing, where square items arrive and depart over time and the objective is to minimize the peak number of…Improved Integrality Gap for Multicommodity Flow on Trees
We improve the best known lower bound on the integrality gap for weighted unit-demand multicommodity flow on trees from $1/4$ to $2/5$, improving on the long-standing bound of Chekuri, Mydlarz, and…Sequential Offering in On-Demand Platforms: On the Optimality of Greedy Ranking
On-demand platforms face the fundamental challenge of fulfilling time-sensitive jobs with independent workers who may decline offers.A Deterministic $O^*((3/2)^n)$ Algorithm for the Parity of Directed Hamiltonian Cycles
We give a deterministic algorithm for the parity of the number of directed Hamiltonian cycles in an $n$-vertex digraph.1.73-Optimal Echelon Stock (R,nQ) Policies in Two-Stage Stochastic Serial Systems
We consider a classical two-stage continuous-review serial inventory system with unit-sized Poisson demand of rate lambda, backlog cost rate p, lead times L_1, L_2, echelon holding-cost rates h_1…Query-Oblivious Coresets for Softmax Attention: Improved Bounds and Efficient Constructions
A query-oblivious coreset for a softmax-attention head is a subset $S$ of the key--value pairs such that attention computed from $S$ alone is within $\varepsilon$ of the full output, in $\ell_2$…Computation and Applications of Euclidean and Normed Representations of Massive Data
This thesis investigates Euclidean-space and $\ell_p$-norm representations of different forms of data, with a focus on efficient algorithms for computing these representations in settings where the…PACO: A Fully Cache-Oblivious Parallel FFT with One Global Redistribution
Fast Fourier transforms on parallel machines incur two forms of data movement: processor-local transfers through the memory hierarchy and global redistribution between processors.Minimization Prophet Inequality with Bounded Costs
We study the cost-minimization prophet inequality problem, in which a decision-maker sequentially observes $n$ independent and identically distributed (IID) random variables.A Group-Based Resource Allocation Model for the Fractional Knapsack Problem
To solve the fractional knapsack problem, Dantzig's greedy rule orders items according to their value-to-cost ratio.A Near-Linear Element Kernel for \(d\)-Hitting Set
In \(d\)-\textsc{Hitting Set}, the input consists of a finite universe \(U\), a family \(\mathcal S\) of subsets of \(U\) with size at most \(d\), and an integer \(k\).A 52-Addition, Rank-23 Scheme for Exact 3 x 3 Matrix Multiplication
We present a rank-23 algorithm for general 3 x 3 matrix multiplication using 52 additions or subtractions, together with a Karstadt-Schwartz-style basis change [1, 2].Tunnelling with a reference
We show how to modify Baier's tunnelling for the case in which we have a non-repetitive and relatively short reference for a highly repetitive and much longer text.Tight Bounds on the Cost of Adaptivity for the Meyerson Sketch
In online facility location, points arrive one at a time, and the algorithm must either open a facility at the arriving point or route the point to an existing facility.