5 citations · 8 across the 8 of their papers we have counts for
8 papers
The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model
Hengzhao Ma, Jianzhong Li
The topology-aware Massively Parallel Computation (MPC) model is proposed and studied recently, which enhances the classical MPC model by the awareness of network topology. The wor…
Turing Machines with Two-level Memory: A Deep Look into the Input/Output Complexity
Hengzhao Ma, Jianzhong Li, Xiangyu Gao +1
The input/output complexity, which is the complexity of data exchange between the main memory and the external memory, has been elaborately studied by a lot of former researchers.…
A New Model for Massively Parallel Computation Considering both Communication and IO Cost
Hengzhao Ma, Xiangyu Gao, Jianzhong Li +1
In the research area of parallel computation, the communication cost has been extensively studied, while the IO cost has been neglected. For big data computation, the assumption th…
The PCP-like Theorem for Sub-linear Time Inapproximability
Hengzhao Ma, Jianzhong Li
In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for proving sub-quadratic time inappro…
PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability
Hengzhao Ma, Jianzhong Li
In this paper we propose the PCP-like theorem for sub-linear time inapproximability. Abboud et al. have devised the distributed PCP framework for sub-quadratic time inapproximabili…
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
Hengzhao Ma, Jianzhong Li
In this paper we propose an algorithm for the approximate k-Nearest-Neighbors problem. According to the existing researches, there are two kinds of approximation criterion. One is…
A True Algorithm for the All-k-Nearest-Neighbors Problem
Hengzhao Ma, Jianzhong Li
In this paper we examined an algorithm for the All-k-Nearest-Neighbor problem proposed in 1980s, which was claimed to have an upper bound on the running time. We find…
An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time
Hengzhao Ma, Jianzhong Li
This paper proposes a new algorithm for reducing Approximate Nearest Neighbor problem to Approximate Near Neighbor problem. The advantage of this algorithm is that it achieves O(lo…