Quanquan C. Liu

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 54

Top Topics

Massively Parallel

Symmetry Breaking

Parallel Algorithm

Differentially Private

Top Venues

Publications

Quanquan C. Liu, C. Seshadhri
Improved Massively Parallel Triangle Counting in O(1) Rounds. CoRR (2024)
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. ALENEX (2024)
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. PPoPP (2024)
Quanquan C. Liu, Julian Shun, Igor Zablotchi
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads. CoRR (2024)
Quanquan C. Liu, Grigoris Velegkas, Yuichi Yoshida, Felix Zhou
Pointwise Lipschitz Continuous Graph Algorithms via Proximal Gradient Analysis. CoRR (2024)
Alessandro Epasto, Quanquan C. Liu, Tamalika Mukherjee, Felix Zhou
The Power of Graph Sparsification in the Continual Release Model. CoRR (2024)
Quanquan C. Liu, C. Seshadhri
Brief Announcement: Improved Massively Parallel Triangle Counting in O(1) Rounds. PODC (2024)
Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu
Fair Allocation of Conflicting Courses under Additive Utilities. AAMAS (2024)
Quanquan C. Liu, Vaidehi Srinivas
The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations. COLT (2024)
Quanquan C. Liu, Vaidehi Srinivas
The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free. CoRR (2023)
Quanquan C. Liu
A note on improved results for one round distributed clique listing. Inf. Process. Lett. 181 (2023)
Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith
Triangle Counting with Local Edge Differential Privacy. CoRR (2023)
Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu
An Algorithmic Approach to Address Course Enrollment Challenges. FORC (2023)
Quanquan C. Liu, Yiduo Ke, Samir Khuller
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. APPROX/RANDOM (2023)
Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun
Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs. CoRR (2023)
Laxman Dhulipala, George Z. Li, Quanquan C. Liu
Near-Optimal Differentially Private k-Core Decomposition. CoRR (2023)
Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu
An Algorithmic Approach to Address Course Enrollment Challenges. CoRR (2023)
Quanquan C. Liu, Yiduo Ke, Samir Khuller
Scalable Auction Algorithms for Bipartite Maximum Matching Problems. CoRR (2023)
Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith
Triangle Counting with Local Edge Differential Privacy. ICALP (2023)
Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
(1) Update Time. ACM Trans. Algorithms 18 (2) (2022)
Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Scheduling with Communication Delay in Near-Linear Time. STACS (2022)
Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun
Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems. SPAA (2022)
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 (2022)
Shiri Antaki, Quanquan C. Liu, Shay Solomon
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems. ITCS (2022)
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)
Quanquan C. Liu
A Note on Improved Results for One Round Distributed Clique Listing. CoRR (2022)
Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM (2022)
Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang
Scheduling with Communication Delay in Near-Linear Time. CoRR (2021)
Lili Su, Quanquan C. Liu, Neha Narula
The Power of Random Symmetry-Breaking in Nakamoto Consensus. CoRR (2021)
Lili Su, Quanquan C. Liu, Neha Narula
The Power of Random Symmetry-Breaking in Nakamoto Consensus. DISC (2021)
Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
Tatamibari Is NP-Complete. FUN (2021)
Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun
Parallel Batch-Dynamic k-Core Decomposition. CoRR (2021)
Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu
-Clique Counting. APOCS (2021)
Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis. SPAA (2020)
Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld
Parallel Algorithms for Small Subgraph Counting. CoRR (2020)
Laxman Dhulipala, Quanquan C. Liu, Julian Shun
Parallel Batch-Dynamic k-Clique Counting. CoRR (2020)
Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch
Tatamibari is NP-complete. CoRR (2020)
Shiri Antaki, Quanquan C. Liu, Shay Solomon
Dynamic Distributed MIS with Improved Bounds. CoRR (2020)
Thaddeus Dryja, Quanquan C. Liu, Neha Narula
A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs. CoRR (2020)
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)
Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon
Fully Dynamic (Δ+1)-Coloring in Constant Update Time. CoRR (2019)
Erik D. Demaine, Quanquan C. Liu
Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers. SPAA (2018)
Thaddeus Dryja, Quanquan C. Liu, Sunoo Park
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. IACR Cryptol. ePrint Arch. 2018 (2018)
Thaddeus Dryja, Quanquan C. Liu, Sunoo Park
Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time. TCC (1) (2018)
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)
Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu
Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity. SPAA (2018)
Thaddeus Dryja, Quanquan C. Liu, Sunoo Park
Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling. CoRR (2018)
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 (2018)
Erik D. Demaine, Quanquan C. Liu
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. WADS (2017)
Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu
Upward Partitioned Book Embeddings. CoRR (2017)
Erik D. Demaine, Quanquan C. Liu
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs. CoRR (2017)
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 (2017)
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 (2017)
Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu
Upward Partitioned Book Embeddings. Graph Drawing (2017)
Quanquan C. Liu, David R. Karger
Kibitz: End-to-End Recommendation System Builder. RecSys (2015)
Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia
Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing. WADS (2015)