research
∙
02/25/2023
The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model
The topology-aware Massively Parallel Computation (MPC) model is propose...
share
research
∙
07/04/2021
The PCP-like Theorem for Sub-linear Time Inapproximability
In this paper we propose the PCP-like theorem for sub-linear time inappr...
research
∙
11/04/2020
PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability
In this paper we propose the PCP-like theorem for sub-linear time inappr...
research
∙
08/07/2020
A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee
In this paper we propose an algorithm for the approximate k-Nearest-Neig...
research
∙
08/01/2019
A True O(n logn) Algorithm for the All-k-Nearest-Neighbors Problem
In this paper we examined an algorithm for the All-k-Nearest-Neighbor pr...
research
∙
08/01/2019
A True O(n n) Algorithm for the All-k-Nearest-Neighbors Problem
In this paper we examined an algorithm for the All-k-Nearest-Neighbor pr...
research
∙
09/26/2018