Mingmou Liu

According to our database, Mingmou Liu authored at least 8 papers between 2018 and 2023.

Collaborative distances:

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

2023

Cell-Probe Lower Bound for Accessible Interval Graphs.

Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu

CoRR, 2023

2022

Higher Lower Bounds for Sparse Oblivious Subspace Embeddings.

Yi Li, Mingmou Liu

CoRR, 2022

On the optimal time/space tradeoff for hash tables.

Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Lower Bounds for Sparse Oblivious Subspace Embeddings.

Yi Li, Mingmou Liu

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021

Nearly Tight Lower Bounds for Succinct Range Minimum Query.

Mingmou Liu

CoRR, 2021

2020

Lower bound for succinct range minimum query.

Mingmou Liu, Huacheng Yu

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Succinct Filters for Sets of Unknown Sizes.

Mingmou Liu, Yitong Yin, Huacheng Yu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018

Randomized Approximate Nearest Neighbor Search with Limited Adaptivity.

Mingmou Liu, Xiaoyin Pan, Yitong Yin

ACM Trans. Parallel Comput., 2018