Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. - Mingmou Liu; Xiaoyin Pan; Yitong Yin (ACM Trans. Parallel Comput., 2018)

Succinct Filters for Sets of Unknown Sizes. - Mingmou Liu; Yitong Yin; Huacheng Yu (ICALP, 2020)

Lower bound for succinct range minimum query. - Mingmou Liu; Huacheng Yu (STOC, 2020)

Nearly Tight Lower Bounds for Succinct Range Minimum Query. - Mingmou Liu (CoRR, 2021)

Lower Bounds for Sparse Oblivious Subspace Embeddings. - Yi Li 002; Mingmou Liu (PODS, 2022)

On the optimal time/space tradeoff for hash tables. - Michael A. Bender; Martin Farach-Colton; John Kuszmaul; William Kuszmaul; Mingmou Liu (STOC, 2022)

Higher Lower Bounds for Sparse Oblivious Subspace Embeddings. - Yi Li 002; Mingmou Liu (CoRR, 2022)

Cell-Probe Lower Bound for Accessible Interval Graphs. - Sankardeep Chakraborty; Christian Engels; Seungbum Jo; Mingmou Liu (CoRR, 2023)