An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O( log n) Query Time. - Heng-Zhao Ma; Jianzhong Li 001 (COCOA, 2018)

An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time. - Heng-Zhao Ma; Jianzhong Li 001 (CoRR, 2018)

CrowdOLA: Online Aggregation on Duplicate Data Powered by Crowdsourcing. - Anzhen Zhang; Jian-Zhong Li 001; Hong Gao 001; Yu-Biao Chen; Heng-Zhao Ma; Mohamed Jaward Bah (J. Comput. Sci. Technol., 2018)

A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem. - Heng-Zhao Ma; Jianzhong Li 001 (COCOA, 2019)

A True O(n log{n}) Algorithm for the All-k-Nearest-Neighbors Problem. - Heng-Zhao Ma; Jianzhong Li 001 (CoRR, 2019)

An O(log⁡n) query time algorithm for reducing ϵ-NN to (c, r)-NN. - Heng-Zhao Ma; Jianzhong Li 001 (Theor. Comput. Sci., 2020)

The PCP-like Theorem for Sub-linear Time Inapproximability. - Hengzhao Ma; Jianzhong Li 001 (CoRR, 2021)

A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee. - Heng-Zhao Ma; Jianzhong Li 001 (Theor. Comput. Sci., 2021)

Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity. - Hengzhao Ma; Jianzhong Li 001; Xiangyu Gao; Tianpeng Gao (COCOON, 2022)

A New Model for Massively Parallel Computation Considering both Communication and IO Cost. - Hengzhao Ma; Xiangyu Gao; Jianzhong Li 001; Tianpeng Gao (CoRR, 2022)

The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model. - Hengzhao Ma; Jianzhong Li 001 (COCOON (2), 2023)

Optimization Problems on The Weighted Massively Parallel Computation Model: Hardness and Algorithms. - Hengzhao Ma; Jianzhong Li 001; Xiangyu Gao (CoRR, 2023)

A New Approach for Semi-External Topological Sorting on Big Graphs. - Tianpeng Gao; Jianzhong Li 001; Hengzhao Ma (IEEE Trans. Knowl. Data Eng., 2023)

Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree. - Hengzhao Ma; Jianzhong Li 001; Yong Zhang (ICDE, 2024)

Turing machines with two-level memory: New computational models for analyzing the input/output complexity. - Hengzhao Ma; Jianzhong Li 001; Tianpeng Gao; Xiangyu Gao (Theor. Comput. Sci., 2024)

Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model. - Hengzhao Ma; Jianzhong Li (J. Comb. Optim., 2025)