Quanquan C. Liu

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Triangle counting with local edge differential privacy Random Structures & Algorithms	2025-08-26	Paper
Differential privacy from locally adjustable graph algorithms: k-core decomposition, low out-degree ordering, and densest subgraphs	2025-08-15	Paper
Brief announcement: improved massively parallel triangle counting in O(1) rounds	2025-06-13	Paper
Scalable auction algorithms for bipartite maximum matching problems	2025-01-14	Paper
Triangle counting with local edge differential privacy	2024-11-14	Paper
Massively parallel algorithms for small subgraph counting	2024-08-22	Paper
Practical parallel algorithms for near-optimal densest subgraphs on massive graphs	2024-05-29	Paper
Scheduling with communication delay in near-linear time	2024-04-23	Paper
scientific article; zbMATH DE number 7829239 (Why is no real title available?) (available as arXiv preprint)	2024-04-09	Paper
scientific article; zbMATH DE number 7774290 (Why is no real title available?) (available as arXiv preprint)	2023-12-08	Paper
Chess Equilibrium Puzzles Mathematics Magazine	2023-11-17	Paper
Fully Dynamic (Δ +1)-Coloring in <i>O</i> (1) Update Time ACM Transactions on Algorithms	2023-10-31	Paper
Tatamibari is NP-complete	2023-02-07	Paper
A note on improved results for one round distributed clique listing Information Processing Letters	2023-02-03	Paper
scientific article; zbMATH DE number 7525474 (Why is no real title available?) (available as arXiv preprint)	2022-05-11	Paper
Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy (available as arXiv preprint)	2021-06-15	Paper
Upward partitioned book embeddings Lecture Notes in Computer Science	2019-02-20	Paper
Upward partitioned book embeddings Lecture Notes in Computer Science	2019-02-20	Paper
Static-memory-hard functions, and modeling the cost of space vs. time	2018-12-11	Paper
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class (available as arXiv preprint)	2018-06-07	Paper
Inapproximability of the standard pebble game and hard to pebble graphs	2017-09-22	Paper
Inapproximability of the standard pebble game and hard to pebble graphs (available as arXiv preprint)	2017-09-22	Paper

Research outcomes over time

This page was built for person: Quanquan C. Liu