Quanquan C. Liu
Orcid: 0000-0003-1230-2754Affiliations:
- UC Berkeley, Simons Institute, CA, USA
- Northwestern University, USA (former)
- MIT CSAIL, Cambridge, MA, USA (former)
According to our database1,
Quanquan C. Liu
authored at least 42 papers
between 2015 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on web.mit.edu
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024
2023
Inf. Process. Lett., March, 2023
CoRR, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023
Proceedings of the Approximation, 2023
2022
ACM Trans. Algorithms, 2022
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.
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.
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.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the Approximation, 2022
2021
PhD thesis, 2021
Proceedings of the 35th International Symposium on Distributed Computing, 2021
Proceedings of the 10th International Conference on Fun with Algorithms, 2021
Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021
2020
A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs.
CoRR, 2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
2019
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
IACR Cryptol. ePrint Arch., 2018
Proceedings of the Theory of Cryptography - 16th International Conference, 2018
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.
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.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
2017
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017
2015
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015
Proceedings of the 9th ACM Conference on Recommender Systems, 2015