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

Email: mingmou.liu AT ntu.edu.sg

Office: SPMS-MAS-04-02, School of Physical and Mathematical Sciences, Nanyang Technological University

I am now a postdoc researcher 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.

I am interested in concrete complexity, especially data structure complexity and communication complexity.

I am looking for a postdoctoral/faculty position starting in 2022!
Please feel free to contact me if you have any questions or concerns!

Manuscripts

• 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 Assistant

• Computational Complexity (For Graduate Students, Fall 2019)
• Computational Complexity (For Graduate Students, Fall 2018)
• Randomized Algorithms (For Graduate Students, Fall 2015)

Services

• Conference paper reviewer: STOC'21, ESA'21, COCOA'21

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.