![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Mingmou Liu
Person information
Refine list
![note](https://dblp.uni-trier.de./img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i8]Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu:
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR abs/2311.02839 (2023) - 2022
- [c5]Yi Li
, Mingmou Liu:
Lower Bounds for Sparse Oblivious Subspace Embeddings. PODS 2022: 251-260 - [c4]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the optimal time/space tradeoff for hash tables. STOC 2022: 1284-1297 - [i7]Yi Li, Mingmou Liu:
Higher Lower Bounds for Sparse Oblivious Subspace Embeddings. CoRR abs/2212.02913 (2022) - 2021
- [i6]Michael A. Bender, Martin Farach-Colton, John Kuszmaul, William Kuszmaul, Mingmou Liu:
On the Optimal Time/Space Tradeoff for Hash Tables. CoRR abs/2111.00602 (2021) - [i5]Mingmou Liu:
Nearly Tight Lower Bounds for Succinct Range Minimum Query. CoRR abs/2111.02318 (2021) - [i4]Yi Li, Mingmou Liu:
Lower Bounds for Sparse Oblivious Subspace Embeddings. CoRR abs/2112.10987 (2021) - 2020
- [c3]Mingmou Liu
, Yitong Yin, Huacheng Yu:
Succinct Filters for Sets of Unknown Sizes. ICALP 2020: 79:1-79:19 - [c2]Mingmou Liu
, Huacheng Yu:
Lower bound for succinct range minimum query. STOC 2020: 1402-1415 - [i3]Mingmou Liu
, Huacheng Yu:
Lower Bound for Succinct Range Minimum Query. CoRR abs/2004.05738 (2020) - [i2]Mingmou Liu
, Yitong Yin, Huacheng Yu:
Succinct Filters for Sets of Unknown Sizes. CoRR abs/2004.12465 (2020)
2010 – 2019
- 2018
- [j1]Mingmou Liu
, Xiaoyin Pan, Yitong Yin:
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. ACM Trans. Parallel Comput. 5(1): 3:1-3:26 (2018) - 2016
- [c1]Mingmou Liu
, Xiaoyin Pan, Yitong Yin:
Randomized Approximate Nearest Neighbor Search with Limited Adaptivity. SPAA 2016: 23-33 - [i1]Mingmou Liu
, Xiaoyin Pan, Yitong Yin:
Randomized approximate nearest neighbor search with limited adaptivity. CoRR abs/1602.04421 (2016)
Coauthor Index
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint