Registration has opened for the Bristol Summer School on Probabilistic Techniques in Computer Science, to be held from 6-11 July 2008.
The purpose of this school is to provide a graduate-level introduction to probabilistic methods in modern theoretical computer science, and to the mathematics underlying these methods. The school is primarily aimed at research students in computer science or mathematics, although postdoctoral applicants and full time research staff from other backgrounds are welcomed.
A range of top international speakers will give short courses on a selection of probabilistic techniques in computer science. The programme includes subjects ranging from immediate commercial applications to pure mathematics.
Specific topics to be covered include:
# Data Stream Algorithms (Graham Cormode, AT&T Labs)
# Random Graphs and Stochastic Processes on Graphs (Ayalvadi Ganesh, Mathematics Department, University of Bristol)
# Communication Complexity (Eyal Kushilevitz, Technion, Israel)
# Auction Theory for Sponsored Search (S. Muthu Muthukrishnan, Google New York)
# Approximation Algorithms (Joseph Naor, Technion, Israel)
# Concentration of Measure (Andreas Winter, Mathematics Department, University of Bristol)
For more information, or to register, see the School's website.