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 30
Minimizing fuzzy Kripke models over residuated lattices
Model minimization is a fundamental problem in formal methods, as smaller models can substantially reduce the complexity of model analysis and reasoning while preserving relevant semantic properties.Polynomial directed treewidth forces a large bramble with congestion two
Brambles of constant congestion in directed graphs have interesting structural and algorithmic applications, and it is desirable to find the smallest function $f_c(k)$ such that if a digraph has…Deterministic Girth Approximation in Weighted Undirected Graphs
We give deterministic algorithms for approximating the girth~$g$ of an undirected graph with $n$ vertices, $m$ edges, and nonnegative real edge lengths.Breaking Two Barriers for Dynamic Planar Reachability
We consider the reachability problem in fully dynamic directed planar graphs: the graph undergoes edge updates (insertions and deletions) and we receive queries asking if one vertex is reachable…Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment
We study simultaneous competitive and regret guarantees for TCP acknowledgment.Tight asymptotic competitive ratio for the Canadian Traveller Problem on unit-weighted grids
We study the $k$-Canadian Traveller Problem (k-ctp), an online navigation problem introduced by Papadimitriou and Yannakakis in 1991.Machine Unlearning for Federated Socially Fair k-Means Clustering
Federated clustering can support applications such as patient stratification across hospitals and customer segmentation across distributed financial datasets.Constructive Arboricity in Almost-Linear Time for Dense Graphs
The arboricity of a graph is the minimum number of forests needed to partition its edges.Algorithms with Smoothed Polynomial-Time Complexity for Deterministic Discounted-sum and Mean-payoff Games
Turn-based deterministic games on graphs are two-player zero-sum games played on finite directed graphs, where the vertex set is partitioned between the Max and the adversarial Min Player.Many Scores Force Many Reads: An Optimality Proof for Score of Parentheses
LeetCode Problem 856, Score of Parentheses, admits a one-pass algorithm using $O(n)$ time and $O(1)$ auxiliary registers.Bipartite Carrier Compression and Machine-Certified Bounds in Schönhage Trilinear Multiplication Tensors
Under the conditional framework breaking the longstanding O(n log n) integer multiplication barrier (originating from OpenAI Preprint #109), the asymptotic time complexity exponent T(n) = O(n (log…Assortment Optimization under the Mallows Model: Independent-Utility Choice Equivalence and Its Algorithmic Implications
The Mallows model is a well-established construct in preference modeling, describing random rankings through their Kendall-Tau distance from a reference permutation.The Sample Complexity of Multicalibration with an ERM Oracle
A predictor is multicalibrated with respect to a class of subpopulations (formally, of functions on the inputs, called auditors) if, for every subpopulation in the class and every value the…Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
We study distribution testing with access to non-adaptive conditional samples.Tight bounds and output sensitive algorithms for maximal clique enumeration in link streams
A link stream is a set of interactions between pairs of vertices, each one lasting during some time interval, and a clique of a link stream is a set of vertices together with a time interval during…The chromatic number of the associahedron: simple and logarithmic
Addario-Berry, Reed, Scott, and Wood (JoCG 2026) proved that the $n$-dimensional associahedron has chromatic number at most $22500\cdot\log_3 n+O(1)$.An ETH-based quasipolynomial lower bound for Dualization
Dualizing monotone Boolean functions (or equivalently, enumerating minimal transversals in hypergraphs) is a long-standing problem whose output-polynomial-time solvability remains open.A QPTAS for Stochastic Scheduling of Bernoulli Jobs
We study the classical problem of scheduling jobs with random processing times on $m$ identical machines to minimize the expected sum of completion times, for Bernoulli jobs: job $j$ takes time…A Refined Analysis for Matroid Secretary with Submodular Objectives
We study the matroid secretary problem with a nonnegative monotone submodular objective.Efficient Recovery of Latent Coordinate Structure from Sparse Observations of the Hypercube
Recovering latent geometric structure from graph observations is a well-studied problem in statistical inference.