Hengzhao Ma

IEEE Trans. Knowl. Data Eng., December, 2023

Optimization Problems on The Weighted Massively Parallel Computation Model: Hardness and Algorithms.

[BibT_eX]

[DOI]

Xiangyu Gao

CoRR, 2023

The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

2022

A New Model for Massively Parallel Computation Considering both Communication and IO Cost.

[BibT_eX]

[DOI]

CoRR, 2022

Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The PCP-like Theorem for Sub-linear Time Inapproximability.

[BibT_eX]

[DOI]

CoRR, 2021

2020

An O(log⁡n) query time algorithm for reducing ϵ-NN to (c, r)-NN.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

2019

A True O(n log{n}) Algorithm for the All-k-Nearest-Neighbors Problem.

[BibT_eX]

[DOI]

CoRR, 2019

A True O(nlog n) Algorithm for the All-k-Nearest-Neighbors Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

CrowdOLA: Online Aggregation on Duplicate Data Powered by Crowdsourcing.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2018

An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(logn) Query Time.

[BibT_eX]

[DOI]

CoRR, 2018

An Algorithm for Reducing Approximate Nearest Neighbor to Approximate Near Neighbor with O(\log n) Query Time.

[BibT_eX]

[DOI]