The following pages link to Quanquan C. Liu (Q1629395):
Displaying 16 items.
- Static-memory-hard functions, and modeling the cost of space vs. time (Q1629397) (← links)
- Inapproximability of the standard pebble game and hard to pebble graphs (Q2405292) (← links)
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- Upward Partitioned Book Embeddings (Q4625113) (← links)
- (Q4993299) (← links)
- (Q5075776) (← links)
- Chess Equilibrium Puzzles (Q6069782) (← links)
- (Q6083411) (← links)
- (Q6126229) (← links)
- Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class (Q6302707) (← links)
- Tatamibari is NP-complete (Q6487564) (← links)
- Scheduling with communication delay in near-linear time (Q6490993) (← links)
- Practical parallel algorithms for near-optimal densest subgraphs on massive graphs (Q6545384) (← links)
- Massively parallel algorithms for small subgraph counting (Q6591892) (← links)
- Triangle counting with local edge differential privacy (Q6638054) (← links)
- Scalable auction algorithms for bipartite maximum matching problems (Q6663043) (← links)
