 |
Bristol Summer School on Probabilistic Techniques in Computer Science6 - 11 July 2008 |
| Overview • Programme • Videos • Registration • Local information • Related events • Poster |
Academic programme
The academic programme of the summer school is planned to run for 5 days, from the 7th to the 11th of July 2008. We expect that most attendees will arrive on Sunday the 6th and leave on Friday the 11th.
The majority of the programme will consist of lectures on the following topics from our invited speakers:- 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)
The Summer School will begin with a keynote lecture by Bela Bollobás, University of Memphis, titled "Inhomogeneous Random Graphs".
All lectures will be held in the Queen's Building, University Walk, Bristol.
There will be a poster session, at which attendees are encouraged to present their work.
Course materials
Some of our speakers have kindly provided us with some course materials for the summer school.- Imhomogeneous Random Graphs (abstract) - Bela Bollobás
- Approximation algorithms 1, 2, 3, 4 (slides) - Seffi Naor
- Communication complexity (slides and survey paper) - Eyal Kushilevitz
- Concentration of measure 1, 2, 3 (slides) - Andreas Winter
- Data stream algorithms (slides and references) - Graham Cormode
Social programme
The programme will also include the following social events:- Welcoming reception
- Summer school dinner
- Excursion
 |
 |
 |
 |
 |