Spurred by the influential work of Viola (Journal of Computing 2012), the past decade has
witnessed an active line of research into the complexity of (approximately) sampling …

Given a distribution over [n] ⁿ such that any k coordinates need k/log^{O (1)} n bits of
communication to sample, we prove that any map that samples this distribution from uniform …

We characterize the power of constant-depth Boolean circuits in generating uniform
symmetric distributions. Let $ f\colon\{0, 1\}^ m\to\{0, 1\}^ n $ be a Boolean function where …

Randomness is a powerful tool, exploited almost everywhere in computer science–from
cryptography, to distributed computing, to algorithm design and more. Unfortunately, most of …

Suppose that a target distribution can be approximately sampled by a low-depth decision
tree, or more generally by an efficient cell-probe algorithm. It is shown to be possible to …