default search action
Quanquan C. Liu
Person information
- affiliation: UC Berkeley, Simons Institute, CA, USA
- affiliation (former): Northwestern University, USA
- affiliation (former): MIT CSAIL, Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX 2024: 59-73 - [c25]Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu:
Fair Allocation of Conflicting Courses under Additive Utilities. AAMAS 2024: 2162-2164 - [c24]Quanquan C. Liu, Vaidehi Srinivas:
The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations. COLT 2024: 3582-3641 - [c23]Quanquan C. Liu
, C. Seshadhri
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC 2024: 519-522 - [c22]Quanquan C. Liu
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. PPoPP 2024: 286-300 - [i27]Quanquan C. Liu, Julian Shun, Igor Zablotchi:
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. CoRR abs/2401.08015 (2024) - [i26]Quanquan C. Liu, C. Seshadhri:
Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR abs/2405.00262 (2024) - [i25]Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida, Felix Zhou:
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis. CoRR abs/2405.08938 (2024) - [i24]Alessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee, Felix Zhou:
The Power of Graph Sparsification in the Continual Release Model. CoRR abs/2407.17619 (2024) - 2023
- [j3]Quanquan C. Liu
A note on improved results for one round distributed clique listing. Inf. Process. Lett. 181: 106355 (2023) - [c21]Quanquan C. Liu, Yiduo Ke, Samir Khuller:
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. APPROX/RANDOM 2023: 28:1-28:24 - [c20]Arpita Biswas
An Algorithmic Approach to Address Course Enrollment Challenges. FORC 2023: 8:1-8:23 - [c19]Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting with Local Edge Differential Privacy. ICALP 2023: 52:1-52:21 - [i23]Arpita Biswas
An Algorithmic Approach to Address Course Enrollment Challenges. CoRR abs/2304.07982 (2023) - [i22]Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting with Local Edge Differential Privacy. CoRR abs/2305.02263 (2023) - [i21]Quanquan C. Liu, Vaidehi Srinivas:
The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free. CoRR abs/2307.08890 (2023) - [i20]Quanquan C. Liu, Yiduo Ke, Samir Khuller:
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. CoRR abs/2307.08979 (2023) - [i19]Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun:
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. CoRR abs/2311.04333 (2023) - [i18]Laxman Dhulipala, George Z. Li, Quanquan C. Liu:
Near-Optimal Differentially Private k-Core Decomposition. CoRR abs/2312.07706 (2023) - 2022
- [j2]Sayan Bhattacharya, Fabrizio Grandoni
Fully Dynamic (Δ +1)-Coloring in O(1) Update Time. ACM Trans. Algorithms 18(2): 10:1-10:25 (2022) - [c18]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic:
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM 2022: 39:1-39:28 - [c17]Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. FOCS 2022: 754-765 - [c16]Shiri Antaki, Quanquan C. Liu, Shay Solomon:
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. ITCS 2022: 7:1-7:25 - [c15]Quanquan C. Liu, Jessica Shi, Shangdi Yu
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. SPAA 2022: 191-204 - [c14]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. STACS 2022: 47:1-47:23 - [i17]Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu
Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs. CoRR abs/2211.10887 (2022) - [i16]Quanquan C. Liu:
A Note on Improved Results for One Round Distributed Clique Listing. CoRR abs/2212.12843 (2022) - 2021
- [b1]Quanquan C. Liu:
Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines. Massachusetts Institute of Technology, USA, 2021 - [c13]Laxman Dhulipala, Quanquan C. Liu, Julian Shun
Parallel Batch-Dynamic k-Clique Counting. APOCS 2021: 129-143 - [c12]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari Is NP-Complete. FUN 2021: 1:1-1:24 - [c11]Lili Su, Quanquan C. Liu, Neha Narula:
The Power of Random Symmetry-Breaking in Nakamoto Consensus. DISC 2021: 39:1-39:19 - [i15]Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun:
Parallel Batch-Dynamic k-Core Decomposition. CoRR abs/2106.03824 (2021) - [i14]Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
Scheduling with Communication Delay in Near-Linear Time. CoRR abs/2108.02770 (2021) - [i13]Lili Su, Quanquan C. Liu, Neha Narula:
The Power of Random Symmetry-Breaking in Nakamoto Consensus. CoRR abs/2108.09604 (2021) - 2020
- [c10]Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA 2020: 63-73 - [i12]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld:
Parallel Algorithms for Small Subgraph Counting. CoRR abs/2002.08299 (2020) - [i11]Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch:
Tatamibari is NP-complete. CoRR abs/2003.08331 (2020) - [i10]Laxman Dhulipala, Quanquan C. Liu, Julian Shun:
Parallel Batch-Dynamic k-Clique Counting. CoRR abs/2003.13585 (2020) - [i9]Thaddeus Dryja, Quanquan C. Liu, Neha Narula:
A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs. CoRR abs/2004.01939 (2020) - [i8]Shiri Antaki, Quanquan C. Liu, Shay Solomon:
Dynamic Distributed MIS with Improved Bounds. CoRR abs/2010.16177 (2020)
2010 – 2019
- 2019
- [c9]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan
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
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
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 Cryptol. ePrint Arch. 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. GD 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).
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 2024-10-24 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: