Previous Conferences & Workshops

We study the parallel time-complexity of basic cryptographic primitives such as one-way functions (OWFs) and pseudorandom generators (PRGs). Specifically, we consider the possibility of computing instances of these primitives by NC0 circuits, in...

In a sequence of preprints M. Gromov introduced a new model of a random quotient of a finitely generated group and indicated that under favourable conditions the quotient groups should be non-trivial and satisfy Kazhdan's Property (T), both with...

We present a 3-D vector dyadic model given in terms of an infinite system of nonlinearly coupled ODE. This toy model is inspired by approximations to the fluid equations studied by Dinaburg and Sinai. The model has structural similarities with the...

The goal of Statistical Learning Theory is to construct and understand algorithms that are able to generalize from a given training data set. Statistical learning algorithms are wildly popular now due to their excellent performance on many types of...

We will describe a result which extends the classical Coifman-Meyer theorem to the multi-parameter setting of polydiscs. This is based on work recently completed jointly with Jill Pipher, Terry Tao and Christoph Thiele.

Let $f:X\to Y$ be a projective map, and assume for simplicity $X$ to be smooth. The Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber states that the (derived direct image of the constant sheaf ${\bf Q}_X$ is isomorphic to a direct...