Liu, Mingmou 刘(liú) 明(míng) 谋(móu)

Email: lmm AT nju.edu.cn

Office: W-229 Nanyong Building, 1520 Taihu Road, Suzhou, Jiangsu, 215163, P.R. China

I am now a tenure-track associate professor at the School of Intelligent Software and Engineering, Nanjing University. Prior to the professership, I was a postdoc in the Department of Computer Science with funding from BARC at the University of Copenhagen. Previously, I was a research fellow in the Division of Mathematical Sciences at Nanyang Technological University hosted by Li, Yi(李翼). I did my PhD at Nanjing University, where I was fortunate to have Professor Yin, Yitong(尹一通) as my adviser.

My research interests lie in the intersection of theoretical computer science and database theory, especially data structure design, data structure complexity, and dimensionality reduction.

Manuscripts

• Sparsity-Dimension Trade-Offs for Oblivious Subspace Embeddings. [arXiv]
  Yi Li, Mingmou Liu.
  
• Cell-Probe Lower Bound for Accessible Interval Graphs. [arXiv]
  Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu.
• Nearly Tight Lower Bounds for Succinct Range Minimum Query. [arXiv]
  Mingmou Liu.

Publications

• Lower Bounds for Sparse Oblivious Subspace Embeddings . [arXiv]
  Yi Li, Mingmou Liu.
  To appear in the 41st ACM Symposium on Principles of Database Systems (PODS 2022).
• On the Optimal Time/Space Tradeoff for Hash Tables. [arXiv]
  Michael A. Bender, Martín Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu
  To appear in the 54th ACM Symposium on Theory of Computing (STOC 2022).
• Succinct Filters for Sets of Unknown Sizes. [arXiv]
  Mingmou Liu, Yitong Yin, and Huacheng Yu.
  In the 47th International Colloquium on Automata, Languages and Programming (ICALP 2020).
• Lower Bound for Succinct Range Minimum Query. [arXiv]
  Mingmou Liu and Huacheng Yu.
  In the 52nd ACM Symposium on Theory of Computing (STOC 2020).
• Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. [arXiv]
  Mingmou Liu, Xiaoyin Pan, and Yitong Yin.
  
  • In the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016). Outstanding paper (best paper finalists).
    
  • In ACM Transactions on Parallel Computing (TOPC) 5, 1, Article 3 (September 2018), 26 pages.

Visiting Experience

• Visiting PhD student at Princeton University, hosted by Yu, Huacheng(俞华程), Sep 2019--Dec 2019.
• Visiting PhD student at Harvard University, hosted by Yu, Huacheng(俞华程), Mar 2019--Jul 2019.

Teaching

• Advanced Algorithms (Spring 2025)
• Foundations of Data Science (Probability and Statistics) (Fall 2024)
• Computational Complexity (As teaching assistant, Fall 2019)
• Computational Complexity (As teaching assistant, Fall 2018)
• Randomized Algorithms (As teaching assistant, For Graduate Students, Fall 2015)

Services

• paper reviewer: SICOMP, STOC'21, ESA'21, COCOA'21, FOCS'22, STOC'23, ICALP'23, SODA'23

Awards & Honors

• National scholarship for graduate students, 2016.
• Outstanding paper (best paper finalists), SPAA 2016.
• 2013 ACM-ICPC China Tonghua Invitational Programming Contest, Gold Medal.
• 2013 ACM-ICPC China Northeast MultiProvincial and Sino-Russia Friendship Programming Contests, Gold Medal.