Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarQuanquan C. Liu
Person information
- affiliation: MIT CSAIL, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – today
- 2019
[c9]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019: 37:1-37:15- [i7]Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon:
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR abs/1910.02063 (2019) - 2018
- [c8]Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams:
Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. ITCS 2018: 34:1-34:23 - [c7]Erik D. Demaine, Quanquan C. Liu:
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. SPAA 2018: 195-204 - [c6]Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu:
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA 2018: 213-222 - [c5]Thaddeus Dryja, Quanquan C. Liu, Sunoo Park:
Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time. TCC (1) 2018: 33-66 - [i6]Thaddeus Dryja, Quanquan C. Liu, Sunoo Park:
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. CoRR abs/1802.07433 (2018) - [i5]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR abs/1806.02771 (2018) - [i4]Thaddeus Dryja, Quanquan C. Liu, Sunoo Park:
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. IACR Cryptology ePrint Archive 2018: 205 (2018) - 2017
- [j1]Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler:
Arboral satisfaction: Recognition and LP approximation. Inf. Process. Lett. 127: 1-5 (2017) - [c4]Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu:
Upward Partitioned Book Embeddings. Graph Drawing 2017: 210-223 - [c3]Erik D. Demaine, Quanquan C. Liu:
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. WADS 2017: 313-324 - [i3]Erik D. Demaine, Quanquan C. Liu:
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. CoRR abs/1707.06343 (2017) - [i2]Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu:
Upward Partitioned Book Embeddings. CoRR abs/1708.06730 (2017) - [i1]Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams:
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy. CoRR abs/1711.07960 (2017) - 2015
- [c2]Quanquan C. Liu, David R. Karger:
Kibitz: End-to-End Recommendation System Builder. RecSys 2015: 335-336 - [c1]Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia:
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. WADS 2015: 263-275
Coauthor Index
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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 and opencitations.net 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 Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from 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 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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2019-10-10 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
