Previous Conferences & Workshops

Earthmover metrics are popular similarity measures in computer vision, and they are also used in the design of approximation algorithms for classification problems. Motivated by the existing nearest neighbor search databases for L_1 metrics, it was...

I will discuss the following theme: starting with an a priori Diophantine result (typical flavour: integer solutions to such-and-such equation are well-spaced) and turning it into an equidistribution-type statement on a homogeneous space. This (in...

Ramanujan graphs are grphs with optimal bounds on their eigenvalues. They play an important role in combinatorics and computer science. Their constructions in the late 80's used the work of Deligne and Drinfeld proving the Ramanujan conjecture for...

I will describe in some detail several different applications of expander graphs, which illuminate the need for explicit constructions of expanders with different properties.

We construct an extractor that can extract from a constant number of independent sources of length $n$, each of which have min-entropy $n^\gamma$ for an arbitrarily small constant $\gamma > 0$. Our constructions are different from recent extractor...