Previous Conferences & Workshops

For a probability distribution X over a finite set, let D(X) denote the L_2-distance of X from the uniform distribution. Let X, Y be probability distributions over the finite group G and let Z be their G-convolution. Inspired by recent work of...

An extension of Szemeredi's Regularity Lemma for hypergraphs, was proved in 2005 by Gowers and independently by Rodl, Schacht, Skokan, and Nagle. More recently, Tao gave another proof for the lemma. A special case, the Removal Lemma is an important...

Valiant's theory of holographic algorithms is a new design method to produce polynomial time algorithms. Information is represented in a superposition of linear vectors in a holographic mix. This mixture creates the possibility for exponential sized...