^June July – 2007

I will give a survey talk on randomness extractors focusing on "seeded extractors". Randomness extractors can be viewed in two ways: The first is as bipartite graphs with certain "expansion properties". The second is as functions that extract pure randomness from somewhat random sources of randomness (so that this randomness can be used in probabilistic algorithms and protocols). In the talk I will give a brief introduction to the area, show some applications and some explicit constructions