Hengzhao Ma

According to our database, Hengzhao Ma authored at least 17 papers between 2018 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Hop-Constrained s-t Simple Path Enumeration: Towards Reducing Repeated Vertex Checks.

Tong Pei, Bin Wang, Hengzhao Ma, Xiaochun Yang, Rui Ding, Jiayi Qu, Baoyan Song

Proceedings of the Database Systems for Advanced Applications, 2026

2025

Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model.

Hengzhao Ma, Jianzhong Li

J. Comb. Optim., August, 2025

2024

Turing machines with two-level memory: New computational models for analyzing the input/output complexity.

Hengzhao Ma, Jianzhong Li, Tianpeng Gao, Xiangyu Gao

Theor. Comput. Sci., February, 2024

Reconsidering Tree based Methods for k-Maximum Inner-Product Search: The LRUS-CoverTree.

Hengzhao Ma, Jianzhong Li, Yong Zhang

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023

A New Approach for Semi-External Topological Sorting on Big Graphs.

Tianpeng Gao, Jianzhong Li, Hengzhao Ma

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

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

Hengzhao Ma, Jianzhong Li, Xiangyu Gao

CoRR, 2023

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

Hengzhao Ma, Jianzhong Li

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

2022

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

Hengzhao Ma, Xiangyu Gao, Jianzhong Li, Tianpeng Gao

CoRR, 2022

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

Hengzhao Ma, Jianzhong Li, Xiangyu Gao, Tianpeng Gao

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

2021

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

Hengzhao Ma, Jianzhong Li

CoRR, 2021

2020

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

Heng-Zhao Ma, Jianzhong Li

Theor. Comput. Sci., 2020

A Sub-linear Time Algorithm for Approximating k-Nearest-Neighbor with Full Quality Guarantee.

Heng-Zhao Ma, Jianzhong Li

Proceedings of the Combinatorial Optimization and Applications, 2020

2019

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

Heng-Zhao Ma, Jianzhong Li

CoRR, 2019

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

Heng-Zhao Ma, Jianzhong Li

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

CrowdOLA: Online Aggregation on Duplicate Data Powered by Crowdsourcing.

Anzhen Zhang, Jian-Zhong Li, Hong Gao, Yu-Biao Chen, Heng-Zhao Ma, Mohamed Jaward Bah

J. Comput. Sci. Technol., 2018

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

Heng-Zhao Ma, Jianzhong Li

CoRR, 2018

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

Heng-Zhao Ma, Jianzhong Li

Proceedings of the Combinatorial Optimization and Applications, 2018