Previous Conferences & Workshops

I plan to survey a number of results, some very old and some very new, mainly proving lower bounds on arithmetic circuits. Common to all is the (often surprising, at least till you get used to it) demonstration of the power of partial derivatives.

Hardness amplification is a major line of research that mainly seeks to transform a given lower bound (e.g. a function that has correlation at most 99% with small circuits) into a strongly average-case one (i.e. a function that has negligible...

For the Rankin-Selberg L-function L(s, , ), there are central value formulas or derivative formulas depending on its root number. Using theta-lifting, Waldspurger showed an explicit formula relating the central value to certain period integral. We...

Error correcting codes encode messages in a way that allows recovery of the original message even in the presence of noise. We study Multiplication codes (Akavia-Goldwasser-Safra FOCS'03), extending them in different ways to allow polynomial...

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: 1. Each comparison can be erroneous with some probability 1 - p. 2. At each stage k comparisons can be performed in parallel and a noisy answer...

In this talk we plan to define and study the spherical Hecke algebra for (untwisted) affine Kac-Moody groups over a local non-archimedian field. We shall prove a generalization of the Satake isomorphism for these algebras, relating it to integrable...