| CrowdOLA: Online aggregation on duplicate data powered by crowdsourcing AZ Zhang, JZ Li, H Gao, YB Chen, HZ Ma, MJ Bah Journal of Computer Science and Technology 33, 366-379, 2018 | 6 | 2018 |
| A True Algorithm for the All-k-Nearest-Neighbors Problem H Ma, J Li International Conference on Combinatorial Optimization and Applications, 362-374, 2019 | 5 | 2019 |
| A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee H Ma, J Li Theoretical Computer Science 857, 59-70, 2021 | 4 | 2021 |
| Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree H Ma, J Li, Y Zhang 2024 IEEE 40th International Conference on Data Engineering (ICDE), 4671-4684, 2024 | 2 | 2024 |
| Optimization problems on the weighted massively parallel computation model: hardness and algorithms H Ma, J Li, X Gao arXiv preprint arXiv:2302.12953, 2023 | 2 | 2023 |
| An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with Query Time H Ma, J Li International Conference on Combinatorial Optimization and Applications, 465-479, 2018 | 2 | 2018 |
| A new approach for semi-external topological sorting on big graphs T Gao, J Li, H Ma IEEE Transactions on Knowledge and Data Engineering 35 (12), 12430-12443, 2023 | 1 | 2023 |
| Turing machines with two-level memory: New computational models for analyzing the input/output complexity H Ma, J Li, T Gao, X Gao Theoretical Computer Science 985, 114347, 2024 | | 2024 |
| The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model H Ma, J Li International Computing and Combinatorics Conference, 106-117, 2023 | | 2023 |
| Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity H Ma, J Li, X Gao, T Gao International Computing and Combinatorics Conference, 199-211, 2022 | | 2022 |
| A New Model for Massively Parallel Computation Considering both Communication and IO Cost H Ma, X Gao, J Li, T Gao arXiv preprint arXiv:2203.12811, 2022 | | 2022 |
| The PCP-like Theorem for Sub-linear Time Inapproximability H Ma, J Li arXiv preprint arXiv:2107.01520, 2021 | | 2021 |
| An O (log n) query time algorithm for reducing ϵ-NN to (c, r)-NN H Ma, J Li Theoretical Computer Science 803, 178-195, 2020 | | 2020 |
| A True O (nlogn) Algorithm for the H Ma, J Li Combinatorial Optimization and Applications: 13th International Conference …, 2019 | | 2019 |