arXiv cs.DS

Data Structures and Algorithms daily digest.

24 past editions, oldest first by date. Atom feed → · all categories

01 — Past editions

most recent first

2026-07-16 Beyond the $d^{2.5}$-mixing bound for Dikin walks on polytopes 4 papers · No. 55
2026-07-15 Privacy Attacks on Stable Marriage 2 papers · No. 54
2026-07-14 CGS: Configurable Graph Summarization with Bounded Neighborhood Loss and... 1 papers · No. 53
2026-07-13 Terminal Dimension Reduction for Time Series with Applications 1 papers · No. 52
2026-07-08 Data-dependent Evaluations for Budgeted Submodular Maximization 1 papers · No. 47
2026-07-07 Terastate-per-second QUBO Brute-Force on a Single GPU: A Matrix... 1 papers · No. 46
2026-07-06 Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates 2 papers · No. 45
2026-07-05 Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates 2 papers · No. 44
2026-07-04 Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates 2 papers · No. 43
2026-07-03 Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates 2 papers · No. 42
2026-07-02 The Binary Tree Mechanism is Optimal for Approximate Differentially Private... 1 papers · No. 41
2026-06-28 Fast algorithms for learning a Gaussian under halfspace truncation with... 1 papers · No. 37
2026-06-27 Fast algorithms for learning a Gaussian under halfspace truncation with... 1 papers · No. 36
2026-06-26 Fast algorithms for learning a Gaussian under halfspace truncation with... 1 papers · No. 35
2026-06-25 Space-Efficient Language Generation in the Limit 1 papers · No. 34
2026-06-18 Learning Augmented Exact Exponential Algorithms 2 papers · No. 27
2026-06-14 Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling 1 papers · No. 23
2026-06-13 Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling 1 papers · No. 22
2026-06-12 Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling 1 papers · No. 21
2026-06-11 Near-Optimal Distributed 2-Ruling Sets on Graphs with Low Arboricity 1 papers · No. 20
2026-06-08 Towards Tight Bounds for Streaming Attention 1 papers · No. 17
2026-05-30 On Language Generation in the Limit with Bounded Memory 1 papers · No. 12
2026-05-28 High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing 1 papers · No. 11
2026-05-27 Parsimonious Learning-Augmented Online Metric Matching 1 papers · No. 10

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.