Quanquan C. Liu

Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs

Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles. In this paper, we present a possibly simpler proof of the result in [CLNV15] and strengthen the result to show that it is PSPACE-hard to determine the minimum number of pebbles to an additive

Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing

n^{1/3-epsilon}

Kibitz: End-to-End Recommendation System Builder

term for all

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

epsilon > 0

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

, which improves upon the currently known additive constant hardness of approximation [CLNV15] in the standard pebble game. We also introduce a family of explicit, constant indegree graphs with

Upward Partitioned Book Embeddings

n

Arboral satisfaction: Recognition and LP approximation

nodes where there exists a graph in the family such that using constant

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

k

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

pebbles requires

Cache Adaptive Exploration

Omega(n^k)