Quanquan C. Liu

According to our database, Quanquan C. Liu authored at least 36 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads.

Quanquan C. Liu, Julian Shun, Igor Zablotchi

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023

A note on improved results for one round distributed clique listing.

Quanquan C. Liu

Inf. Process. Lett., March, 2023

Near-Optimal Differentially Private k-Core Decomposition.

Laxman Dhulipala, George Z. Li, Quanquan C. Liu

CoRR, 2023

Practical Parallel Algorithms for Near-Optimal Densest Subgraphs on Massive Graphs.

Pattara Sukprasert, Quanquan C. Liu, Laxman Dhulipala, Julian Shun

CoRR, 2023

The Predicted-Deletion Dynamic Model: Taking Advantage of ML Predictions, for Free.

Quanquan C. Liu, Vaidehi Srinivas

CoRR, 2023

Triangle Counting with Local Edge Differential Privacy.

Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

An Algorithmic Approach to Address Course Enrollment Challenges.

Arpita Biswas, Yiduo Ke, Samir Khuller, Quanquan C. Liu

Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

Scalable Auction Algorithms for Bipartite Maximum Matching Problems.

Quanquan C. Liu, Yiduo Ke, Samir Khuller

Proceedings of the Approximation, 2023

2022

Fully Dynamic (Δ +1)-Coloring in <i>O</i>(1) Update Time.

Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon

ACM Trans. Algorithms, 2022

Scheduling with Communication Delay in Near-Linear Time.

Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems.

Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems.

Shiri Antaki, Quanquan C. Liu, Shay Solomon

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Differential Privacy from Locally Adjustable Graph Algorithms: k-Core Decomposition, Low Out-Degree Ordering, and Densest Subgraphs.

Laxman Dhulipala, Quanquan C. Liu, Sofya Raskhodnikova, Jessica Shi, Julian Shun, Shangdi Yu

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Massively Parallel Algorithms for Small Subgraph Counting.

Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic

Proceedings of the Approximation, 2022

2021

Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines.

Quanquan C. Liu

PhD thesis, 2021

Parallel Batch-Dynamic k-Core Decomposition.

Quanquan C. Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, Julian Shun

CoRR, 2021

The Power of Random Symmetry-Breaking in Nakamoto Consensus.

Lili Su, Quanquan C. Liu, Neha Narula

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Tatamibari Is NP-Complete.

Aviv Adler, Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine, Quanquan C. Liu, Jayson Lynch

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

Parallel Batch-Dynamic <i>k</i>-Clique Counting.

Laxman Dhulipala, Quanquan C. Liu, Julian Shun, Shangdi Yu

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020

Dynamic Distributed MIS with Improved Bounds.

Shiri Antaki, Quanquan C. Liu, Shay Solomon

CoRR, 2020

A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs.

Thaddeus Dryja, Quanquan C. Liu, Neha Narula

CoRR, 2020

Parallel Batch-Dynamic k-Clique Counting.

Laxman Dhulipala, Quanquan C. Liu, Julian Shun

CoRR, 2020

Parallel Algorithms for Small Subgraph Counting.

Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld

CoRR, 2020

Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis.

Michael A. Bender, Rezaul Alam Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Fully Dynamic (Δ+1)-Coloring in Constant Update Time.

Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, Shay Solomon

CoRR, 2019

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.

Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling.

Thaddeus Dryja, Quanquan C. Liu, Sunoo Park

IACR Cryptol. ePrint Arch., 2018

Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time.

Thaddeus Dryja, Quanquan C. Liu, Sunoo Park

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity.

Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Helen Xu

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers.

Erik D. Demaine, Quanquan C. Liu

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.

Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Arboral satisfaction: Recognition and LP approximation.

Erik D. Demaine, Varun Ganesan, Vladislav Kontsevoi, Qipeng Liu, Quanquan C. Liu, Fermi Ma, Ofir Nachum, Aaron Sidford, Erik Waingarten, Daniel Ziegler

Inf. Process. Lett., 2017

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs.

Erik D. Demaine, Quanquan C. Liu

Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Upward Partitioned Book Embeddings.

Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, Quanquan C. Liu

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2015

Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing.

Erik D. Demaine, Tim Kaler, Quanquan C. Liu, Aaron Sidford, Adam Yedidia

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Kibitz: End-to-End Recommendation System Builder.

Quanquan C. Liu, David R. Karger

Proceedings of the 9th ACM Conference on Recommender Systems, 2015