We gratefully acknowledge support from
the Simons Foundation and member institutions.

Data Structures and Algorithms

Authors and titles for recent submissions, skipping first 25

[ total of 58 entries: 1-10 | 6-15 | 16-25 | 26-35 | 36-45 | 46-55 | 56-58 ]
[ showing 10 entries per page: fewer | more | all ]

Fri, 24 May 2024 (continued, showing 10 of 17 entries)

[26]  arXiv:2405.14765 (cross-list from quant-ph) [pdf, other]
Title: A Quantum Speed-Up for Approximating the Top Eigenvectors of a Matrix
Authors: Yanlin Chen, András Gilyén, Ronald de Wolf
Comments: 50 pages
Subjects: Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
[27]  arXiv:2405.14194 (cross-list from cs.SI) [pdf, other]
Title: Graphlets correct for the topological information missed by random walks
Authors: Sam F. L. Windels, Noel Malod-Dognin, Natasa Przulj
Subjects: Social and Information Networks (cs.SI); Artificial Intelligence (cs.AI); Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG)
[28]  arXiv:2405.14183 (cross-list from cs.LG) [pdf, other]
Title: Deterministic Policies for Constrained Reinforcement Learning in Polynomial-Time
Authors: Jeremy McMahan
Subjects: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS)
[29]  arXiv:2405.14066 (cross-list from cs.LG) [pdf, ps, other]
Title: Online Classification with Predictions
Authors: Vinod Raman, Ambuj Tewari
Comments: 24 pages
Subjects: Machine Learning (cs.LG); Data Structures and Algorithms (cs.DS); Machine Learning (stat.ML)
[30]  arXiv:2405.13994 (cross-list from cs.LG) [pdf, other]
Title: Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
Authors: Murad Tukan, Loay Mualem, Moran Feldman
Subjects: Machine Learning (cs.LG); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[31]  arXiv:2405.13877 (cross-list from cs.CG) [pdf, ps, other]
Title: On connections between k-coloring and Euclidean k-means
Authors: Enver Aman, Karthik C. S., Sharath Punna
Subjects: Computational Geometry (cs.CG); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[32]  arXiv:2405.13875 (cross-list from cs.CC) [pdf, other]
Title: On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
Authors: Davide Bilò, Giordano Colli, Luca Forlizzi, Stefano Leucci
Subjects: Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
[33]  arXiv:2405.13797 (cross-list from math.CO) [pdf, other]
Title: Sparse Induced Subgraphs of Large Treewidth
Authors: Édouard Bonnet
Comments: 16 pages, 3 figures
Subjects: Combinatorics (math.CO); Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS)
[34]  arXiv:2405.13420 (cross-list from math.NT) [pdf, ps, other]
Title: Recovering short generators via negative moments of Dirichlet $L$-functions
Authors: Iu-Iong Ng, Yuichiro Toma
Comments: 16 pages
Subjects: Number Theory (math.NT); Data Structures and Algorithms (cs.DS)
[35]  arXiv:2405.13351 (cross-list from quant-ph) [pdf, other]
Title: Quantum (Inspired) $D^2$-sampling with Applications
Authors: Ragesh Jaiswal, Poojan Shah
Comments: arXiv admin note: substantial text overlap with arXiv:2308.08167
Subjects: Quantum Physics (quant-ph); Data Structures and Algorithms (cs.DS)
[ total of 58 entries: 1-10 | 6-15 | 16-25 | 26-35 | 36-45 | 46-55 | 56-58 ]
[ showing 10 entries per page: fewer | more | all ]

Disable MathJax (What is MathJax?)

Links to: arXiv, form interface, find, cs, new, 2405, contact, help  (Access key information)