| Parallel Batch-Dynamic k-Clique Counting L Dhulipala, QC Liu, J Shun, S Yu Symposium on Algorithmic Principles of Computer Systems (APOCS), 129-143, 2021 | 14 | 2021 |
| Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy ED Demaine, A Lincoln, QC Liu, J Lynch, VV Williams arXiv preprint arXiv:1711.07960, 2017 | 12 | 2017 |
| Red-blue and standard pebble games: complexity and applications in the sequential and parallel models Q Liu Massachusetts Institute of Technology, 2017 | 11 | 2017 |
| Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class ED Demaine, TD Goodrich, K Kloster, B Lavallee, QC Liu, BD Sullivan, ... arXiv preprint arXiv:1806.02771, 2018 | 10 | 2018 |
| Inapproximability of the standard pebble game and hard to pebble graphs ED Demaine, QC Liu Workshop on Algorithms and Data Structures, 313-324, 2017 | 9 | 2017 |
| Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis MA Bender, RA Chowdhury, R Das, R Johnson, W Kuszmaul, A Lincoln, ... Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 8 | 2020 |
| Fully dynamic (∆+ 1)-coloring in constant update time S Bhattacharya, F Grandoni, J Kulkarni, QC Liu, S Solomon CoRR, abs/1910.02063, 2019 | 8 | 2019 |
| Tatamibari is NP-complete A Adler, J Bosboom, ED Demaine, ML Demaine, QC Liu, J Lynch arXiv preprint arXiv:2003.08331, 2020 | 7 | 2020 |
| Fully Dynamic -Coloring in Constant Update Time S Bhattacharya, F Grandoni, J Kulkarni, QC Liu, S Solomon arXiv preprint arXiv:1910.02063, 2019 | 7 | 2019 |
| Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity A Lincoln, QC Liu, J Lynch, H Xu Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 7 | 2018 |
| Red-Blue Pebble Game: Complexity of Computing the Trade-Off between Cache Size and Memory Transfers ED Demaine, QC Liu Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 6 | 2018 |
| Clickomania is hard, even with two colors and columns A Adler, ED Demaine, A Hesterberg, Q Liu, M Rudoy The Mathematics of Various Entertaining Subjects: Research in Games, Graphs …, 2017 | 6 | 2017 |
| Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing ED Demaine, T Kaler, Q Liu, A Sidford, A Yedidia Algorithms and Data Structures - 14th International Symposium, WADS 2015 …, 2015 | 6 | 2015 |
| Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time T Dryja, QC Liu, S Park Theory of Cryptography Conference, 33-66, 2018 | 5 | 2018 |
| Upward partitioned book embeddings HA Akitaya, ED Demaine, A Hesterberg, QC Liu International Symposium on Graph Drawing and Network Visualization, 210-223, 2017 | 5 | 2017 |
| Kibitz: End-to-End Recommendation System Builder Q Liu, DR Karger Proceedings of the 9th ACM Conference on Recommender Systems, 335-336, 2015 | 5 | 2015 |
| Parallel Algorithms for Small Subgraph Counting AS Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld arXiv preprint arXiv:2002.08299, 2020 | 4 | 2020 |
| Parallel Batch-Dynamic -Core Decomposition QC Liu, J Shi, S Yu, L Dhulipala, J Shun arXiv preprint arXiv:2106.03824, 2021 | 2 | 2021 |
| Static-Memory-Hard Functions and Nonlinear Space-Time Tradeoffs via Pebbling T Dryja, QC Liu, S Park arXiv preprint arXiv:1802.07433, 2018 | 2 | 2018 |
| Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines QC Liu Massachusetts Institute of Technology, 2021 | 1 | 2021 |
