Previous Conferences & Workshops

We study the local testabilty of sparse linear codes. This problem is intimately connected to the problem of tolerant linearity testing of Boolean functions under nonuniform distributions. We give linearity tests for several natural and interesting...

The INDEX problem is one of a handful of fundamental problems in communication complexity: Alice has an n-bit string x, Bob has an index k in [n], and the players wish to determine the k-th bit of x. It is easy to show that the problem is "hard"...

The $\lambda$-invariant is an invariant of an imaginary quadratic field that measures the growth of class numbers in cyclotomic towers over the field. It also measures the number of zeroes of an associated $p$-adic L-function. In this talk, I will...

These two talks will be about automorphic cohomology in the non-classical case. By definition, automorphic cohomology are the groups $H^q( \Gamma \backslash D, L)$ where $D$ is a homogeneous complex manifold $G_{\mathbb R}/H$, $G_{\mathbb R}$ is a...

These two talks will be about automorphic cohomology in the non-classical case. By definition, automorphic cohomology are the groups $H^q( \Gamma \backslash D, L)$ where $D$ is a homogeneous complex manifold $G_{\mathbb R}/H$, $G_{\mathbb R}$ is a...

The complexity of simple stochastic games (SSGs) has been open since they were defined by Condon in 1992. Such a game is played by two players, Min and Max, on a graph consisting of max nodes, min nodes, and average nodes. The goal of Max is to...

The basic ingredients of Darwinian evolution, selection and mutation, are very well described by simple mathematical models. In 1973, John Maynard Smith linked game theory with evolutionary processes through the concept of evolutionarily stable...