共 50 条
- [2] Sublinear Time Eigenvalue Approximation via Random Sampling [J]. ALGORITHMICA, 2024, 86 (06) : 1764 - 1829
- [5] Sublinear-Time Clustering Oracle for Signed Graphs [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
- [6] A sublinear-time approximation scheme for bin packing [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5082 - 5092
- [7] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling [J]. Algorithmica, 2018, 80 : 668 - 697
- [8] Differentially-Private Sublinear-Time Clustering [J]. 2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 332 - 337
- [10] Sublinear-time approximation of Euclidean minimum spanning tree [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 813 - 822