共 50 条
- [1] Extending Nearly-Linear Models PROCEEDINGS OF THE ELEVENTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES: THEORIES AND APPLICATIONS (ISIPTA 2019), 2019, 103 : 82 - 90
- [4] BILEVEL FEATURE SELECTION IN NEARLY-LINEAR TIME 2016 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2016,
- [5] Better Approximations for Tree Sparsity in Nearly-Linear Time PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2215 - 2229
- [6] Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
- [7] Group isomorphism is nearly-linear time for most orders 2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 457 - 467
- [8] Sorting Signed Permutations by Reversals in Nearly-Linear Time 2024 SYMPOSIUM ON SIMPLICITY IN ALGORITHMS, SOSA, 2024, : 199 - 214
- [9] A Nearly-Linear Time Framework for Graph-Structured Sparsity INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 37, 2015, 37 : 928 - 937
- [10] Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 919 - 930