Why locality sensitive hashing works: A practical perspective. - Kejing Lu; Hongya Wang; Yingyuan Xiao; Hui Song (Inf. Process. Lett., 2018)

R2LSH: A Nearest Neighbor Search Scheme Based on Two-dimensional Projected Spaces. - Kejing Lu; Mineichi Kudo (ICDE, 2020)

VHP: Approximate Nearest Neighbor Search via Virtual Hypersphere Partitioning. - Kejing Lu; Hongya Wang; Wei Wang 011; Mineichi Kudo (Proc. VLDB Endow., 2020)

Approximate Query Processing with Error Guarantees. - Tianjia Ni; Kento Sugiura; Yoshiharu Ishikawa; Kejing Lu (BDA (Astronomy, Science, and Engineering), 2021)

MLSH: Mixed Hash Function Family for Approximate Nearest Neighbor Search in Multiple Fractional Metrics. - Kejing Lu; Mineichi Kudo (DASFAA (2), 2021)

AdaLSH: Adaptive LSH for Solving c-Approximate Maximum Inner Product Search Problem. - Kejing Lu; Mineichi Kudo (IEICE Trans. Inf. Syst., 2021)

HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search. - Kejing Lu; Mineichi Kudo; Chuan Xiao 001; Yoshiharu Ishikawa (Proc. VLDB Endow., 2021)

MQH: Locality Sensitive Hashing on Multi-level Quantization Errors for Point-to-Hyperplane Distances. - Kejing Lu; Yoshiharu Ishikawa; Chuan Xiao 001 (Proc. VLDB Endow., 2022)

Acceleration of Synopsis Construction for Bounded Approximate Query Processing. - Tianjia Ni; Kento Sugiura; Yoshiharu Ishikawa; Kejing Lu (DASFAA (Workshops), 2024)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search. - Kejing Lu; Chuan Xiao 001; Yoshiharu Ishikawa (ICML, 2024)

Guaranteeing an Exact Error Bound for Bounded Approximate Query Processing. - Tianjia Ni; Kento Sugiura; Yoshiharu Ishikawa; Kejing Lu (J. Inf. Process., 2024)

Hierarchical and Efficient Synopsis Construction for Bounded Approximate Query Processing. - Tianjia Ni; Kento Sugiura; Yoshiharu Ishikawa; Kejing Lu (J. Inf. Process., 2025)

Probabilistic Kernel Function for Fast Angle Testing. - Kejing Lu; Chuan Xiao 001; Yoshiharu Ishikawa (CoRR, 2025)