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 27
Bipartite Matching with Few Rounds of Demand Queries
We study the randomised and deterministic demand-query complexity of approximate bipartite matching with few query rounds.Settling the Approximability of Submodular Facility Location
In submodular facility location (SFL), introduced by Svitkina and Tardos (SODA 2006), clients $\cal C$ in a metric space are assigned to facilities $\cal F$.Finding non-bisimplicial and triad-free minimal separators
A $u\hbox{-}v$ separator in $G$ is a set $S\subseteq V(G)\setminus\{u,v\}$ such that there is no $u\hbox{-}v$ path in $G\setminus S$.Online Tokenization with Optimal Delay in Linear Time
Tokenization is an essential preprocessing step in almost all large language models (LLMs).With Leverage, the Gambler is Not the One Who Gets Ruined
In this note we explore the following simple question: How does the classic \emph{gambler's ruin} phenomenon change if we allow the gambler \emph{financial leverage}?Online Batching with Lookahead: Adversarial Limits and Stochastic Gains
Modern inference systems rely on batching to exploit parallel execution and amortize serial execution overheads, but batching creates a fundamental online scheduling tradeoff: serving requests…QPTAS for Max Weight Independent Set in Graphs with Strongly Edge-Sublinear Separators
A hereditary graph class has strongly edge-sublinear separators if, for some constant $0 \leqslant b < 1$, every graph in the class with $m$ edges admits a balanced separator of size $\mathcal…Stochastic Weighted Caching with Per-Request Predictions
Both the unweighted and weighted variants of caching are cornerstone problems in competitive analysis, with tight randomized competitive ratios of $Θ(\log k)$, where $k$ is the cache size.Online Submodular Welfare Maximization: Computation is not the Bottleneck
We revisit the online submodular welfare maximization problem (OSW), a vast generalization of numerous well-studied online allocation problems, including online bipartite matching, display ads and…Improved Approximations for Coflow Scheduling via Iterated Rounding and Stable Matchings
We study Coflow Scheduling, introduced by Chowdhury, Zhong, and Stoica (2014).Approximation algorithms via discrepancy with hard constraints
In this paper, we present a discrepancy-based approach to cost-preserving rounding under hard constraints.Hashrope: A Persistent Data Structure for Mechanisms of LLM Context Management
Serving stacks for large language models manage context through four recurring mechanisms: incremental edits to a growing context, branching and snapshotting for tree search, identification of…Bootstrapping Classical and Quantum Query Lower Bounds for Finding Tarski Fixed Points
The Tarski fixed-point problem asks for a fixed point of a monotone map on a $k$-dimensional grid lattice of width $n$ and has applications in game theory, economics, and verification.Fast Quantized Johnson$-$Lindenstrauss Transforms
Quantization has emerged as one of the primary techniques for reducing the memory footprint of large language models during inference.Ramsey Meets Simultaneous Planarity: Vertex Integrity and Pathwidth
We study the following simultaneous embedding problem: Given k graphs on the same vertex set with the same pairwise intersection, do they admit planar drawings that coincide on their shared graph?Graph determination problem from knowledge of its subgraphs
In the context of graph reconstruction studies, this paper addresses the problem defined as follows: given a sample of vertex-coloured graphs, each associated with a number, does there exist a…Distributed $(Δ+1)$-Coloring in $O(\sqrtΔ+\log^* n)$ Rounds
We give a deterministic distributed algorithm for $(Δ+1)$-coloring an $n$-node graph of maximum degree $Δ$ in $O(\sqrtΔ+\log^* n)$ rounds in both the LOCAL and CONGEST models.Dynamic Maximal Independent Set using Predictions
We present the first dynamic maximal independent set (MIS) of a graph with $n$ vertices and up to $m$ edges under edge updates in the prediction model, where a predicted update sequence is available…Graph Matching in Random Geometric Graphs I: Efficient Algorithms
We study the recovery of the hidden vertex correspondence between two correlated dense random geometric graphs.Averaged Annealed Markov Chains Achieve the Algorithmic Threshold for Tensor PCA, Part I: Glauber Dynamics
In the tensor principal components analysis (tensor PCA) problem, we are asked to recover an unknown vector in $\{\pm1\}^N$ from a noisy observation of its $k$-th tensor power, for a fixed $k\ge3$.