Previous Conferences & Workshops

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...