activity
20182023
most citedAn Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time

5 citations · 8 across the 8 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.CC2023

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…