Common information is ubiquitous in information theory and related areas such as
theoretical computer science and discrete probability. However, because there are multiple …

For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we
show that a gadget-composed version of F is hard to refute in any proof system whose lines …

The task of manipulating correlated random variables in a distributed setting has received
attention in the fields of both Information Theory and Computer Science. Often shared …

We consider the following non-interactive simulation problem: Alice and Bob observe
sequences X n and Y n, respectively, where ((X i, Y i)} i= 1 n are drawn independent …

Quantum correlations and nonprojective measurements underlie a plethora of information-
theoretic tasks, otherwise impossible in the classical world. Existing schemes to certify such …

Let p≥ 2. We improve the bound|| f|| p/|| f|| 2≤(p-1) s/2 for a polynomial f of degree s on the
boolean cube {0, 1} n, which comes from hypercontractivity, replacing the right hand side of …

We consider the following problem: Alice and Bob observe sequences X n and Y n
respectively where {(X i, Y i)} i= 1∞ are drawn iid from P (x, y), and they output U and V …

Correlated secret randomness is a useful resource for secure computation protocols, often
enabling dramatic speedups compared to protocols in the plain model. This has motivated a …

The communication complexity of many fundamental problems reduces greatly when the
communicating parties share randomness that is independent of the inputs to the …

Consider two sequences of n independent and identically distributed fair coin tosses, X=(X
1,..., X n) and Y=(Y 1,..., Y n), which are ρ-correlated for each j, ie P [X j= Y j]= 1+ ρ/2. We …