13.00-13.45	Ronald Meester, Free University of Amsterdam	Percolation of covering algorithms
14.00-14.45	John Wierman, Johns Hopkins University	Bounds for critical probabilities of Archimedean lattices
15.15-16.00	Stanislav Smirnov, KTH	Critical percolation in the plane
16.15-17.00	Harry Kesten, Cornell University	Greedy lattice animals when negative contributions are allowed

For more infomration, contact Olle Häggström.