Rohan Chauhan, Ioannis Panageas: Learning Ising Models under Hard Constraints using One Sample https://arxiv.org/abs/2509.20993 https://arxiv.org/pdf/2509.20993 https://arxiv.org/html/2509.20993

Andrey Boris Khesin, Jonathan Z. Lu, Alexander Poremba, Akshar Ramkumar, Vinod Vaikuntanathan: Average-Case Complexity of Quantum Stabilizer Decoding https://arxiv.org/abs/2509.20697 https://arxiv.org/pdf/2509.20697 https://arxiv.org/html/2509.20697

Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So: Actively Learning Halfspaces without Synthetic Data https://arxiv.org/abs/2509.20848 https://arxiv.org/pdf/2509.20848 https://arxiv.org/html/2509.20848

[2025-09-26 Fri (UTC), 1 new article found for csDS Data Structures and Algorithms]

Roman Edenhofer, Atsuya Hasegawa, Fran\c{c}ois Le Gall: Dequantization and Hardness of Spectral Sum Estimation https://arxiv.org/abs/2509.20183 https://arxiv.org/pdf/2509.20183 https://arxiv.org/html/2509.20183

Ojas Parekh: No Quantum Advantage in Decoded Quantum Interferometry for MaxCut https://arxiv.org/abs/2509.19966 https://arxiv.org/pdf/2509.19966 https://arxiv.org/html/2509.19966

Zihang Ma: ALNS for Tugboat Scheduling in Inland Waterway https://arxiv.org/abs/2509.19718 https://arxiv.org/pdf/2509.19718 https://arxiv.org/html/2509.19718

Spencer Compton: Efficient $\varepsilon$-approximate minimum-entropy couplings https://arxiv.org/abs/2509.19598 https://arxiv.org/pdf/2509.19598 https://arxiv.org/html/2509.19598

Talya Eden, Ronitt Rubinfeld, Arsen Vasilyan: Testable algorithms for approximately counting edges and triangles in sublinear time and space https://arxiv.org/abs/2509.20351 https://arxiv.org/pdf/2509.20351 https://arxiv.org/html/2509.20351

Kailash Gopal Darmasubramanian, Akash Pareek, Arindam Khan, Arpit Agarwal: Ads that Stick: Near-Optimal Ad Optimization through Psychological Behavior Models https://arxiv.org/abs/2509.20304 https://arxiv.org/pdf/2509.20304 https://arxiv.org/html/2509.20304

Matthias Gehnen, Moritz Stocker: Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal https://arxiv.org/abs/2509.19914 https://arxiv.org/pdf/2509.19914 https://arxiv.org/html/2509.19914

Amyra Meidiana, Seok-Hee Hong, Kwan-Liu Ma: BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing https://arxiv.org/abs/2509.19785 https://arxiv.org/pdf/2509.19785 https://arxiv.org/html/2509.19785

Frederic Gillet: Geometric Interpretation of 3-SAT and Phase Transition https://arxiv.org/abs/2509.19740 https://arxiv.org/pdf/2509.19740 https://arxiv.org/html/2509.19740

Amyra Meidiana, Seok-Hee Hong: SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing https://arxiv.org/abs/2509.19703 https://arxiv.org/pdf/2509.19703 https://arxiv.org/html/2509.19703

Ziyad Benomar, Romain Cosson, Alexander Lindermayr, Jens Schl\"oter: Non-Clairvoyant Scheduling with Progress Bars https://arxiv.org/abs/2509.19662 https://arxiv.org/pdf/2509.19662 https://arxiv.org/html/2509.19662

Felix Hommelsheim, Alexander Lindermayr, Zhenwei Liu: A Better-Than-$5/4$-Approximation for Two-Edge Connectivity https://arxiv.org/abs/2509.19655 https://arxiv.org/pdf/2509.19655 https://arxiv.org/html/2509.19655

Kyle Doney, Cameron Musco: A Note on Fine-Grained Quantum Reductions for Linear Algebraic Problems https://arxiv.org/abs/2509.19528 https://arxiv.org/pdf/2509.19528 https://arxiv.org/html/2509.19528

[2025-09-25 Thu (UTC), 9 new articles found for csDS Data Structures and Algorithms]

Ilias Diakonikolas, Jelena Diakonikolas, Daniel M. Kane, Jasper C. H. Lee, Thanasis Pittas: Linear Regression under Missing or Corrupted Coordinates https://arxiv.org/abs/2509.19242 https://arxiv.org/pdf/2509.19242 https://arxiv.org/html/2509.19242

Atharv Pandey, Lakshmanan Kuppusamy: Optimization of Base-n Radix Sort for Skewed Datasets https://arxiv.org/abs/2509.19021 https://arxiv.org/pdf/2509.19021 https://arxiv.org/html/2509.19021

Jananthan, Kepner, Jones, Gadepally, Houle, Michaleas, Milner, Pentland: GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices https://arxiv.org/abs/2509.18984 https://arxiv.org/pdf/2509.18984 https://arxiv.org/html/2509.18984

Arun Kumar Das, Michal Opler, Tom\'a\v{s} Valla: Precoloring extension with demands on paths https://arxiv.org/abs/2509.18936 https://arxiv.org/pdf/2509.18936 https://arxiv.org/html/2509.18936

[2025-09-24 Wed (UTC), 4 new articles found for csDS Data Structures and Algorithms]

Noah G. Singer, Madhur Tulsiani, Santhoshini Velusamy: Sketching approximations and LP approximations for finite CSPs are related https://arxiv.org/abs/2509.17926 https://arxiv.org/pdf/2509.17926 https://arxiv.org/html/2509.17926

J. J. Bernal, J. J. Sim\'on: Hyperbolic Sets in Incomplete Tables https://arxiv.org/abs/2509.17591 https://arxiv.org/pdf/2509.17591 https://arxiv.org/html/2509.17591

Zhao Song, Jianfei Xue, Lichen Zhang: Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming https://arxiv.org/abs/2509.16915 https://arxiv.org/pdf/2509.16915 https://arxiv.org/html/2509.16915

Hunter McCoy, Prashant Pandey: WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables https://arxiv.org/abs/2509.16407 https://arxiv.org/pdf/2509.16407 https://arxiv.org/html/2509.16407

Alexey Markin, Tavis K. Anderson: Ordered Leaf Attachment (OLA) Vectors can Identify Reticulation Events even in Multifurcated Trees https://arxiv.org/abs/2509.16405 https://arxiv.org/pdf/2509.16405 https://arxiv.org/html/2509.16405

Florian Kurpicz, Niccol\`o Rigi-Luperti, Peter Sanders: Theory Meets Practice for Bit Vectors Supporting Rank and Select https://arxiv.org/abs/2509.17819 https://arxiv.org/pdf/2509.17819 https://arxiv.org/html/2509.17819

Hadley Black, Christopher Ye: Distribution Testing in the Presence of Arbitrarily Dominant Noise with Verification Queries https://arxiv.org/abs/2509.17269 https://arxiv.org/pdf/2509.17269 https://arxiv.org/html/2509.17269

Hsien-Chih Chang, Jonathan Conroy: Distance Approximating Minors for Planar and Minor-Free Graphs https://arxiv.org/abs/2509.17226 https://arxiv.org/pdf/2509.17226 https://arxiv.org/html/2509.17226

Nikhil Bansal, Zhiyi Huang, Zixuan Zhu: Optimal 4-Approximation for the Correlated Pandora's Problem https://arxiv.org/abs/2509.17029 https://arxiv.org/pdf/2509.17029 https://arxiv.org/html/2509.17029

Soh Kumabe: Quadratic Kernel for Cliques or Trees Vertex Deletion https://arxiv.org/abs/2509.16815 https://arxiv.org/pdf/2509.16815 https://arxiv.org/html/2509.16815

Zhao Song, David P. Woodruff, Lichen Zhang: Sublinear Time Quantum Sensitivity Sampling https://arxiv.org/abs/2509.16801 https://arxiv.org/pdf/2509.16801 https://arxiv.org/html/2509.16801

[2025-09-23 Tue (UTC), 6 new articles found for csDS Data Structures and Algorithms]

Rachana Gusain, Saladi Rahul, Aditya Subramanian: A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions https://arxiv.org/abs/2509.16008 https://arxiv.org/pdf/2509.16008 https://arxiv.org/html/2509.16008

Maria Chudnovsky, Julien Codsi: Tree-independence number VI. Thetas and pyramids https://arxiv.org/abs/2509.15458 https://arxiv.org/pdf/2509.15458 https://arxiv.org/html/2509.15458

V Vijendran, Dax Enshan Koh, Ping Koy Lam, Syed M Assad: Classical and Quantum Heuristics for the Binary Paint Shop Problem https://arxiv.org/abs/2509.15294 https://arxiv.org/pdf/2509.15294 https://arxiv.org/html/2509.15294

Vaishali Surianarayanan, Neeraj Kumar, Stavros Sintos: Clustering with Set Outliers and Applications in Relational Clustering https://arxiv.org/abs/2509.16194 https://arxiv.org/pdf/2509.16194 https://arxiv.org/html/2509.16194

Gautam Kamath, Alireza F. Pour, Matthew Regehr, David P. Woodruff: Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph https://arxiv.org/abs/2509.16180 https://arxiv.org/pdf/2509.16180 https://arxiv.org/html/2509.16180

Julien Sorci: Analyzing and improving a classical Betti number estimation algorithm https://arxiv.org/abs/2509.16171 https://arxiv.org/pdf/2509.16171 https://arxiv.org/html/2509.16171

Ashwin Jacob, Diptapriyo Majumdar, Raghav Sakhuja: On the Structural Parameterizations of 2-Club with Triangle Constraints https://arxiv.org/abs/2509.16143 https://arxiv.org/pdf/2509.16143 https://arxiv.org/html/2509.16143

Ji\v{r}\'i Fink: Constant time enumeration of perfect bipartite matchings https://arxiv.org/abs/2509.16135 https://arxiv.org/pdf/2509.16135 https://arxiv.org/html/2509.16135

Xinran Ma, Zhaoqi Zhou, Chuan Zhou, Qi Meng, Zaijiu Shang, Guoliang Li, Zhiming Ma: Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization https://arxiv.org/abs/2509.15531 https://arxiv.org/pdf/2509.15531 https://arxiv.org/html/2509.15531

[2025-09-22 Mon (UTC), 6 new articles found for csDS Data Structures and Algorithms]

Deijany Rodriguez Linares, Oksana Moryakova, H{\aa}kan Johansson: Efficient Computation of Time-Index Powered Weighted Sums Using Cascaded Accumulators https://arxiv.org/abs/2509.15069 https://arxiv.org/pdf/2509.15069 https://arxiv.org/html/2509.15069

Simon D\"oring, Sarah Houdaigoui, Lucas Picasarri-Arrieta, Philip Wellnitz: The Complexity of Finding and Counting Subtournaments https://arxiv.org/abs/2509.14807 https://arxiv.org/pdf/2509.14807 https://arxiv.org/html/2509.14807

Eric R. Anschuetz, David Gamarnik, Jonathan Z. Lu: Decoded Quantum Interferometry Requires Structure https://arxiv.org/abs/2509.14509 https://arxiv.org/pdf/2509.14509 https://arxiv.org/html/2509.14509

Harry Chen, Kamesh Munagala, Govind S. Sankar: Balanced Spanning Tree Distributions Have Separation Fairness https://arxiv.org/abs/2509.15137 https://arxiv.org/pdf/2509.15137 https://arxiv.org/html/2509.15137

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto: Minimum Sum Coloring with Bundles in Trees and Bipartite Graphs https://arxiv.org/abs/2509.15080 https://arxiv.org/pdf/2509.15080 https://arxiv.org/html/2509.15080