{"generated_at":"2026-10-10T00:58:38Z","total":294,"page":0,"pages":3,"page_size":100,"next":"/api/catalog?topic=algorithms-complexity&page=1","documents":[{"id":"arxiv-2610.07114","title":"Sample-Optimal Estimation of the Fréchet Inception Distance","year":2026,"authors":["Ziyun Chen","Jerry Li","Kevin Tian"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["statistical-learning","algorithms-complexity"],"keywords":["cs.LG","cs.CV","cs.DS","math.ST","stat.ML","stat.TH"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.07114","fulltext_endpoint":"/api/document/arxiv-2610.07114/fulltext","references_endpoint":null},{"id":"arxiv-2406.14506","title":"Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities","year":2026,"authors":["Will Ma","Calum MacRury","Pranav Nuti"],"author_count":3,"journal":"In EC 2024","doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM","math.CO"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2406.14506","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2302.02006","title":"Robust Budget Pacing with a Single Sample","year":2026,"authors":["Santiago Balseiro","Rachitesh Kumar","Vahab Mirrokni"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.LG","cs.DS","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2302.02006","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2508.02249","title":"A Threshold Number for the Shortest Vector Problem in the Infinity Norm","year":2026,"authors":["Stefan Kuhlmann","Robert Weismantel"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.OC","cs.DS","math.CO"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2508.02249","fulltext_endpoint":"/api/document/arxiv-2508.02249/fulltext","references_endpoint":null},{"id":"arxiv-2508.19473","title":"Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids","year":2026,"authors":["Stephen Arndt","Benjamin Moseley","Kirk Pruhs"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2508.19473","fulltext_endpoint":"/api/document/arxiv-2508.19473/fulltext","references_endpoint":null},{"id":"arxiv-2511.20385","title":"Counting large patterns in degenerate graphs","year":2026,"authors":["Christine Awofeso","Patrick Greaves","Oded Lachish"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2511.20385","fulltext_endpoint":"/api/document/arxiv-2511.20385/fulltext","references_endpoint":null},{"id":"arxiv-2602.00162","title":"Covers for Initial Value Problem: Complete Validated Algorithms with Complexity Analysis","year":2026,"authors":["Bingwei Zhang","Chee Yap"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CC"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2602.00162","fulltext_endpoint":"/api/document/arxiv-2602.00162/fulltext","references_endpoint":null},{"id":"arxiv-2608.24493","title":"Optimal Lower Bound for Ground-State Energy Estimation with a Guiding State","year":2026,"authors":["Rolando D. Somma","Ronald de Wolf"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2608.24493","fulltext_endpoint":"/api/document/arxiv-2608.24493/fulltext","references_endpoint":null},{"id":"arxiv-2609.18023","title":"A quantitative tree-likeness bound from average hyperbolicity","year":2026,"authors":["Joon-Hyeok Yim"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.PR","cs.DS","math.CO","math.MG"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.18023","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.23458","title":"An Arboricity-Sensitive Algorithm for the $K_r-e$-Free Graph Sandwich Problem","year":2026,"authors":["Min Chih Lin","Natán Vekselman"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.23458","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.23604","title":"Budget-Independent Influence Maximization in Nearly Linear Time","year":2026,"authors":["Zhijie Zhang"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.SI"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.23604","fulltext_endpoint":"/api/document/arxiv-2609.23604/fulltext","references_endpoint":null},{"id":"arxiv-2609.33779","title":"Solving Vertex Integrity Faster than $2^n$","year":2026,"authors":["Sandip Das","Sweta Das","Sk Samim Islam"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.33779","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38367","title":"Certifiable Near-Optimality: A Simple Framework for Unifying Search and Refutation for (Semi)random CSPs","year":2026,"authors":["Prashanti Anderson","Peter Manohar","Jeff Xu"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.38367","fulltext_endpoint":"/api/document/arxiv-2609.38367/fulltext","references_endpoint":null},{"id":"arxiv-2609.38685","title":"Auction-Based Algorithms for Matroid Intersection: Near-Linear Query Complexity and Constant-Pass Semi-Streaming","year":2026,"authors":["Chien-Chung Huang","Yusuke Kobayashi"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.38685","fulltext_endpoint":"/api/document/arxiv-2609.38685/fulltext","references_endpoint":null},{"id":"arxiv-2609.38710","title":"High-accuracy simulation of Picard HMC, part I: Gaussian cloud correction","year":2026,"authors":["Fan Chen","Sinho Chewi","Jianfeng Lu"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","numerical-mathematics"],"keywords":["math.ST","cs.DS","cs.NA","math.NA","stat.TH"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38710","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38686","title":"Faster network motif discovery by counting isomorphic subtrees","year":2026,"authors":["Tarek Tohme","Joshua A. Grochow"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.38686","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39042","title":"Provable Classical and Quantum Local Algorithms for Max-$k$-Cut and Quantum Advantage at Moderate Girth","year":2026,"authors":["Anuj Apte","Abid Khan","Edward Farhi"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39042","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39052","title":"A Robustified Greedy Algorithm for Online Transportation with Improved Competitive Guarantees","year":2026,"authors":["Ritesh Seth","Syamantak Das","Sharath Raghvendra"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39052","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39062","title":"Breaking the $2^n$ barrier for directed hamiltonicity","year":2026,"authors":["Tomohiro Koana","Soh Kumabe"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39062","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39233","title":"MultiTable: A Faster Hash Table at any Physical Load Factor up to and Including One","year":2026,"authors":["Maksym Petkus"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.CR","cs.DS","math.CO","math.PR"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39233","fulltext_endpoint":"/api/document/arxiv-2609.39233/fulltext","references_endpoint":null},{"id":"arxiv-2609.39292","title":"Polynomial-time algorithm for exact $(1,2)$-center problem under continuous Fréchet distance","year":2026,"authors":["Soumya Bhattacharya","Serene Rasheed","Sasanka Roy"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.CG","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39292","fulltext_endpoint":"/api/document/arxiv-2609.39292/fulltext","references_endpoint":null},{"id":"arxiv-2609.39349","title":"Multidimensional Resource Scheduling with Small Demands","year":2026,"authors":["Yossi Azar","Rathish Das","Hao Sun"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39349","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39457","title":"A Quantum Scaling Algorithm for Maximum-Weight Perfect Matching in General Graphs","year":2026,"authors":["Kourosh Mirsohi","Sandy Irani","Michael T. Goodrich"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","quant-ph"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39457","fulltext_endpoint":"/api/document/arxiv-2609.39457/fulltext","references_endpoint":null},{"id":"arxiv-2609.39557","title":"Consensus for Compressed Static Functions","year":2026,"authors":["Dominik Rosch","Jonatan Ziegler"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39557","fulltext_endpoint":"/api/document/arxiv-2609.39557/fulltext","references_endpoint":null},{"id":"doi-b7275b2588f15b9eae14","title":"$(α, β)$ Spanners and Hybrid Spanners with Nearly Tight Bounds","year":2026,"authors":["Shiri Chechik","Gur Lifshitz"],"author_count":2,"journal":"Proceedings of SODA 2026, pp. 3511-3535","doi":"10.1137/1.9781611978971.128","source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-b7275b2588f15b9eae14","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39656","title":"Testing Induced-Subgraph Freeness in Outerplanar Graphs under the Random-Neighbor Oracle","year":2026,"authors":["Pan Peng","Kefan Yu"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39656","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39666","title":"Connected Dominating Set on Semi-Ladder-Free Graphs","year":2026,"authors":["Sobyasachi Chatterjee","Sushmita Gupta","Saket Saurabh"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39666","fulltext_endpoint":"/api/document/arxiv-2609.39666/fulltext","references_endpoint":null},{"id":"arxiv-2609.39821","title":"Learning Random Quantum Circuits and the Emergence of Pseudorandomness","year":2026,"authors":["Srinivasan Arunachalam","Qizhao Huang","Makrand Sinha"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.39821","fulltext_endpoint":"/api/document/arxiv-2609.39821/fulltext","references_endpoint":null},{"id":"arxiv-2609.40016","title":"Component-Weighted Centroid Search for Exact Incremental BPE","year":2026,"authors":["Harshit Verma","Rex Ying"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.LG"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40016","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.39918","title":"Verifiable quantum advantage based on polynomials with planted structures","year":2026,"authors":["Markus Bläser","Michael Gullans","Dominik Hangleiter"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.CR","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.39918","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40077","title":"Robust and Learned Online Matching in Growing Trees","year":2026,"authors":["Marek Gałązka","Hanna Wdowicka"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.LG","math.PR"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40077","fulltext_endpoint":"/api/document/arxiv-2609.40077/fulltext","references_endpoint":null},{"id":"arxiv-2609.40088","title":"Super-Quadratic Quantum Speedups for Combinatorial Optimization via Tilted Walks","year":2026,"authors":["Guneykan Ozgul","Shouvanik Chakrabarti"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40088","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40136","title":"Sharper Gaussian Covers in the Bansal--Huang--Lee Coloring Framework","year":2026,"authors":["Konstantin Makarychev","Yury Makarychev"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40136","fulltext_endpoint":"/api/document/arxiv-2609.40136/fulltext","references_endpoint":null},{"id":"arxiv-2609.40147","title":"Policy Iteration Is Not Strongly Polynomial for Deterministic Markov Decision Processes: The Price of Algorithmic Anarchy","year":2026,"authors":["Han Zhong","Yinyu Ye"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.LG","cs.DS","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40147","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40249","title":"Dynamic Time Warping in the Low-Distance Regime","year":2026,"authors":["Itai Boneh","Shay Golan","Tomasz Kociumaka"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40249","fulltext_endpoint":"/api/document/arxiv-2609.40249/fulltext","references_endpoint":null},{"id":"arxiv-2609.40254","title":"Quantum oblique eigenprojection","year":2026,"authors":["Alexander M. Dalzell","Yuan Su"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS","physics.chem-ph"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40254","fulltext_endpoint":"/api/document/arxiv-2609.40254/fulltext","references_endpoint":null},{"id":"arxiv-2609.40293","title":"Quantum Fine-Grained Lower Bounds for SetDisjointness via Sub-Linear Reductions from 3SUM","year":2026,"authors":["Jeremy Huang","Young Kun Ko","Chunhao Wang"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.CC","cs.DS","quant-ph"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40293","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40299","title":"Mixing FM-indexes and CSAs: backward search over an order-1 rank encoding","year":2026,"authors":["Travis Gagie"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40299","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40302","title":"Solving Sparse SDPs in Sublinear Time: A Classical Algorithm Inspired by the Quantum OR Lemma","year":2026,"authors":["Fernando G. S. L. Brandão","Alexander M. Dalzell","András Gilyén"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40302","fulltext_endpoint":"/api/document/arxiv-2609.40302/fulltext","references_endpoint":null},{"id":"arxiv-2609.40321","title":"Exponential quantum speedup for $\\mathbb{F}_3^n$-Subset-Sum? Or, rigorous classical algorithms for Binary-Error LWE","year":2026,"authors":["Robin Kothari","Tony Metger","Ryan O'Donnell"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CR","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.40321","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.40345","title":"Gibbs Sampling in the Shattered Phase by Decoded Quantum Interferometry","year":2026,"authors":["Leo Zhou","Noah Shutty","Mark Sellke"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cond-mat.dis-nn","cs.CC","cs.DS","math.PR"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.40345","fulltext_endpoint":"/api/document/arxiv-2609.40345/fulltext","references_endpoint":null},{"id":"arxiv-2410.13548","title":"Adaptive and oblivious statistical adversaries are equivalent","year":2026,"authors":["Guy Blanc","Gregory Valiant"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.LG","cs.CC","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2410.13548","fulltext_endpoint":"/api/document/arxiv-2410.13548/fulltext","references_endpoint":null},{"id":"arxiv-2509.07155","title":"Quantum algorithms for general nonlinear dynamics based on the Carleman embedding","year":2026,"authors":["David Jennings","Kamil Korzekwa","Matteo Lostaglio"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","numerical-mathematics"],"keywords":["quant-ph","cs.DS","cs.NA","math.NA"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2509.07155","fulltext_endpoint":"/api/document/arxiv-2509.07155/fulltext","references_endpoint":null},{"id":"arxiv-2512.16087","title":"Instance-Optimality of Bidirectional PageRank Estimation","year":2026,"authors":["Mikkel Thorup","Hanzhi Wang"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2512.16087","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2604.27651","title":"Solving Hypergraph Laplacian Systems in Almost-Linear Time","year":2026,"authors":["Yuichi Yoshida"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2604.27651","fulltext_endpoint":"/api/document/arxiv-2604.27651/fulltext","references_endpoint":null},{"id":"arxiv-2606.13583","title":"Testing Bipartiteness in Logarithmic Rounds","year":2026,"authors":["Yumou Fei","Ronitt Rubinfeld"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2606.13583","fulltext_endpoint":"/api/document/arxiv-2606.13583/fulltext","references_endpoint":null},{"id":"arxiv-2606.02183","title":"Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration","year":2026,"authors":["Karl Bringmann","Nick Fischer","Yanheng Wang"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DB"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2606.02183","fulltext_endpoint":"/api/document/arxiv-2606.02183/fulltext","references_endpoint":null},{"id":"arxiv-2607.07153","title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","year":2026,"authors":["Seiei Ando","Yu Yokoi"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DM","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2607.07153","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2607.28260","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","year":2026,"authors":["Tongyang Li","Fengning Ou","Xinzhao Wang"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2607.28260","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.14879","title":"Fast Stencil Computations on a Single Arbitrarily Moving Interval","year":2026,"authors":["Aaron Gregory"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DC"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.14879","fulltext_endpoint":"/api/document/arxiv-2609.14879/fulltext","references_endpoint":null},{"id":"arxiv-2609.15642","title":"Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231","year":2026,"authors":["Henning Arnór Skeggi Úlfarsson"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.CO","cs.DM","cs.DS","cs.LO"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.15642","fulltext_endpoint":"/api/document/arxiv-2609.15642/fulltext","references_endpoint":null},{"id":"arxiv-2609.18707","title":"Total Variation Distance Estimation through Domain Reduction","year":2026,"authors":["Arnab Bhattacharyya","Graham Cormode","Yucheng Fu"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","math.PR"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.18707","fulltext_endpoint":"/api/document/arxiv-2609.18707/fulltext","references_endpoint":null},{"id":"arxiv-2609.28472","title":"Hutch#: Optimal non-adaptive Frobenius norm estimation","year":2026,"authors":["Tyler Chen","Diana Halikias","Christopher Musco"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","numerical-mathematics"],"keywords":["math.NA","cs.DS","cs.NA"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.28472","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.33493","title":"An EPTAS for Vector Scheduling with Time Intervals","year":2026,"authors":["Junho Hwang"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CC"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.33493","fulltext_endpoint":"/api/document/arxiv-2609.33493/fulltext","references_endpoint":null},{"id":"arxiv-2609.35668","title":"Optimal Query Complexity for Ground-State Preparation","year":2026,"authors":["Boyang Chen","Minbo Gao","Xinzhao Wang"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.35668","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.38736","title":"Quantum Query Complexity for List Search","year":2026,"authors":["Niranka Banerjee","Akinori Kawachi"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.38736","fulltext_endpoint":"/api/document/arxiv-2609.38736/fulltext","references_endpoint":null},{"id":"arxiv-2610.00103","title":"Exact Universality of Online Discrepancy","year":2026,"authors":["Sunghyeon Jo","Taekyun Lee"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.PR","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00103","fulltext_endpoint":"/api/document/arxiv-2610.00103/fulltext","references_endpoint":null},{"id":"arxiv-2610.00177","title":"Improved Lower Bound for Steiner Point Removal","year":2026,"authors":["Karthekeyan Chandrasekaran","Chandra Chekuri","Qingyun Chen"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00177","fulltext_endpoint":"/api/document/arxiv-2610.00177/fulltext","references_endpoint":null},{"id":"arxiv-2610.00310","title":"A Tight Second-Order Lower Bound for Routing Labels in Trees","year":2026,"authors":["Hanqing Li"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00310","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00387","title":"Faster Stable Numerical Polynomial Multiplication","year":2026,"authors":["Hong Duc Bui"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00387","fulltext_endpoint":"/api/document/arxiv-2610.00387/fulltext","references_endpoint":null},{"id":"arxiv-2610.00491","title":"Dynamic Connectivity, Minimum Spanning Tree, and 2-Edge Connectivity with Polylogarithmic Worst-Case Update Time","year":2026,"authors":["Simon Meierhans","Maximilian Probst Gutenberg","Yu-Cheng Yeh"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00491","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00567","title":"Faster Algorithms for Finding Small Induced Patterns in Sparse Host Graphs","year":2026,"authors":["Priyanshi Agrawal","Balagopal Komarath"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00567","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00547","title":"Unifying and Extending Strong Simulation of Quantum Circuits","year":2026,"authors":["Floris Geerts","Rihan Hai","Matthias Lanzinger"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00547","fulltext_endpoint":"/api/document/arxiv-2610.00547/fulltext","references_endpoint":null},{"id":"arxiv-2610.00577","title":"Query-efficient winner prediction in district-based elections","year":2026,"authors":["Koustav De","Debajyoti Kar","Swagato Sanyal"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.AI"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00577","fulltext_endpoint":"/api/document/arxiv-2610.00577/fulltext","references_endpoint":null},{"id":"arxiv-2610.00688","title":"The Power of Two-Choice Linear Probing","year":2026,"authors":["Amir Azarmehr","Michael A. Bender","William Kuszmaul"],"author_count":4,"journal":"FOCS 2026","doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00688","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00846","title":"Sparsification Framework for Directed Densest Subgraph","year":2026,"authors":["Slobodan Mitrović","Theodore Pan"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.00846","fulltext_endpoint":"/api/document/arxiv-2610.00846/fulltext","references_endpoint":null},{"id":"arxiv-2610.00874","title":"Beyond odd characteristic: Faster isomorphism testing of 2-groups of Frattini class 2","year":2026,"authors":["Joshua A. Grochow","Gábor Ivanyos","Youming Qiao"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","math.GR"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00874","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.00941","title":"Best of Two Worlds: Combining High and Low Resolution to Compute Viewsheds on terrains","year":2026,"authors":["Laura Toma"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.00941","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01071","title":"Coloring 3-colorable graphs with $O(n^{4/23})$ colors via a Gaussian-cover recursion","year":2026,"authors":["Emile Anand"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CC","cs.DM","math.CO"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01071","fulltext_endpoint":"/api/document/arxiv-2610.01071/fulltext","references_endpoint":null},{"id":"arxiv-2610.01007","title":"Settling the Pass Complexity of Streaming Set Cover","year":2026,"authors":["Sepehr Assadi","Janani Sundaresan"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01007","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01149","title":"When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure","year":2026,"authors":["Xinyu Wang","Ziyu Zhao","Yixuan He"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.AI"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01149","fulltext_endpoint":"/api/document/arxiv-2610.01149/fulltext","references_endpoint":null},{"id":"arxiv-2610.01311","title":"Factor Three Approximation for Edit Distance","year":2026,"authors":["Egor Gorbachev"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01311","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01343","title":"Robust Non-Clairvoyant Scheduling with Classification Models","year":2026,"authors":["Anthony Dugois","Vincent Fagnon","Giorgio Lucarelli"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.LG","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01343","fulltext_endpoint":"/api/document/arxiv-2610.01343/fulltext","references_endpoint":null},{"id":"arxiv-2610.01591","title":"Stable and Online Algorithms for Random Matrix Discrepancy","year":2026,"authors":["Eren C. Kızıldağ","Shuangping Li"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CC","cs.DM","math.CO","math.PR"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01591","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01648","title":"Exact Locality Gaps for Matchable Semi-Matchings","year":2026,"authors":["Marek Gałązka","Hanna Wdowicka"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01648","fulltext_endpoint":"/api/document/arxiv-2610.01648/fulltext","references_endpoint":null},{"id":"arxiv-2610.01678","title":"Safe Hypergraph Contraction via Capacity-Aware Repair Certificates","year":2026,"authors":["Yu Deng","Xinyi Yang","Keren Zhu"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01678","fulltext_endpoint":"/api/document/arxiv-2610.01678/fulltext","references_endpoint":null},{"id":"arxiv-2610.01752","title":"Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model","year":2026,"authors":["Chandrima Kayal","Sayantan Sen","Dániel Szabó"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.01752","fulltext_endpoint":"/api/document/arxiv-2610.01752/fulltext","references_endpoint":null},{"id":"arxiv-2610.01853","title":"Achieving Optimal Redundancy for Small Dynamic Rank/Select Dictionaries","year":2026,"authors":["Gabriel Marques Domingues"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01853","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.01993","title":"Beating One Half for Online Bipartite Matching with Reusable Resources","year":2026,"authors":["Xiaohui Bei","Zhihao Gavin Tang","Wenhao Wu"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.01993","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02008","title":"Convergence of Kikuchi matrices to $Γ$-independent and $q$-Gaussian limits","year":2026,"authors":["Afonso S. Bandeira","Dmitriy Kunisky","Petar Nizić-Nikolac"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.PR","cs.DS","math.OA"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02008","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02016","title":"Vertex-Failure Distance Oracles and Labeling Schemes: Compact and Constant-Approximate","year":2026,"authors":["Yaowei Long"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.02016","fulltext_endpoint":"/api/document/arxiv-2610.02016/fulltext","references_endpoint":null},{"id":"arxiv-2610.02094","title":"Quantum state preparation for weighted d-DNNF","year":2026,"authors":["Steef Hegeman","Joon Hyung Lee","Alfons Laarman"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02094","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02079","title":"A computational phase diagram for the transverse field Ising model","year":2026,"authors":["Thuy-Duong Vuong"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS","math-ph","math.MP","math.PR"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2610.02079","fulltext_endpoint":"/api/document/arxiv-2610.02079/fulltext","references_endpoint":null},{"id":"arxiv-2610.02131","title":"Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes","year":2026,"authors":["Han Zhong","Yinyu Ye"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.LG","cs.DS","math.OC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02131","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02095","title":"Randomized Matvec Lower Bounds for Simplex-Based Matrix Games","year":2026,"authors":["Wendao Wu","Cong Fang"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.OC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02095","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2610.02146","title":"Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits","year":2026,"authors":["Matthew Coudron","Michael J. Gullans","Jon Nelson"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2610.02146","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-0470fd3f07a08138635e","title":"Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs","year":2026,"authors":["Lluís Alemany-Puig","Juan Luis Esteban","Ramon Ferrer-i-Cancho"],"author_count":3,"journal":"Alemany-Puig, L., Esteban, J.L. & Ferrer-i-Cancho, R. (2026). Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs. Journal of Combinatorial Optimization 52, 16","doi":"10.1007/s10878-026-01454-z","source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.DM","math.CO"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/doi-0470fd3f07a08138635e","fulltext_endpoint":"/api/document/doi-0470fd3f07a08138635e/fulltext","references_endpoint":null},{"id":"arxiv-2609.37979","title":"Can We Break Fine-Grained and NP-Hardness Barriers if We've Seen the Graph Before? The Isomorphic-Priors Model","year":2026,"authors":["Dani Dorfman","Simon Döring","Martin G. Herold"],"author_count":7,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.37979","fulltext_endpoint":null,"references_endpoint":null},{"id":"doi-c4f299d1b21fd2c7eab8","title":"ConflictSync: Bandwidth Efficient Synchronization of Divergent State","year":2025,"authors":["Pedro Silva Gomes","Miguel Boaventura Rodrigues","Carlos Baquero"],"author_count":3,"journal":"2026. Proceedings of the 13th International Workshop on Principles and Practice of Consistency for Distributed Data","doi":"10.1145/3806077.3806697","source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/doi-c4f299d1b21fd2c7eab8","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2506.08261","title":"Quick(er)sort and optimal adaptivity","year":2026,"authors":["Sandeep Sen"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CC"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2506.08261","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2510.08427","title":"A convergent hierarchy of spectral gap certificates for qubit Hamiltonians","year":2026,"authors":["Sujit Rao"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2510.08427","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2602.15802","title":"Local Node Differential Privacy","year":2026,"authors":["Sofya Raskhodnikova","Adam Smith","Connor Wagaman"],"author_count":4,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS","cs.CR"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2602.15802","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2603.24880","title":"The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring","year":2026,"authors":["Yuta Inoue","Ken-ichi Kawarabayashi","Atsuyuki Miyashita"],"author_count":6,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["math.CO","cs.CG","cs.DM","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2603.24880","fulltext_endpoint":"/api/document/arxiv-2603.24880/fulltext","references_endpoint":null},{"id":"arxiv-2606.30358","title":"Learning the structure of open quantum systems","year":2026,"authors":["Laura Lewis","Ewin Tang","John Wright"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.DS","cs.LG"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2606.30358","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2607.07691","title":"Faster quantum linear system solver beyond the condition number","year":2026,"authors":["Alexander M. Dalzell","Jianqiang Li","Yuan Su"],"author_count":3,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","numerical-mathematics"],"keywords":["quant-ph","cs.DS","cs.NA","math.NA"],"license":"CC-BY-SA-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2607.07691","fulltext_endpoint":"/api/document/arxiv-2607.07691/fulltext","references_endpoint":null},{"id":"arxiv-2609.10808","title":"Tight Time-Space Lower Bounds for Collision Finding and Element Distinctness under Label Symmetry","year":2026,"authors":["Frédéric Magniez","Sebastian Zur"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["quant-ph","cs.CC","cs.CR","cs.DS"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.10808","fulltext_endpoint":"/api/document/arxiv-2609.10808/fulltext","references_endpoint":null},{"id":"arxiv-2609.28781","title":"Eigenvalue and Eigenvector Approximation for Random Matrices Using Low-Degree Polynomials","year":2026,"authors":["Yihan Zhang"],"author_count":1,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","numerical-mathematics"],"keywords":["math.PR","cs.DS","cs.NA","math.NA","math.ST","stat.TH"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.28781","fulltext_endpoint":"/api/document/arxiv-2609.28781/fulltext","references_endpoint":null},{"id":"arxiv-2609.32176","title":"Efficient Support Recovery of Mixtures of Sparse Linear Classifiers with Fewer Measurements","year":2026,"authors":["Xiaxin Li","Arya Mazumdar"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity","information-theory"],"keywords":["cs.LG","cs.DS","cs.IT","math.IT"],"license":"CC-BY-4.0","has_fulltext":true,"has_references":false,"rights_class":"licensed_content","access":"paid","version":2,"content_endpoint":"/api/document/arxiv-2609.32176","fulltext_endpoint":"/api/document/arxiv-2609.32176/fulltext","references_endpoint":null},{"id":"arxiv-2609.36778","title":"XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps","year":2026,"authors":["Yinglong Gan","Jintao Yu","Shenggang Ying"],"author_count":5,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.36778","fulltext_endpoint":null,"references_endpoint":null},{"id":"arxiv-2609.37913","title":"Byzantine Causal Reliable Broadcast with Constant Metadata Overhead","year":2026,"authors":["Purv Patel","Ajay D. Kshemkalyani"],"author_count":2,"journal":null,"doi":null,"source":"arxiv","topics":["algorithms-complexity"],"keywords":["cs.DC","cs.DS"],"license":"CC0-1.0","has_fulltext":false,"has_references":false,"rights_class":"metadata_only","access":"paid","version":1,"content_endpoint":"/api/document/arxiv-2609.37913","fulltext_endpoint":null,"references_endpoint":null}]}