On Sunday 7 December, Professor Patrick Morin of Carleton University, Ottawa gave an expository series of lectures on randomised algorithms. The short course covered the following:
  1. Sorting and searching (Slides)
  2. Geometric and Combinatorial Optimisation (Slides)
  3. Concentration (Slides)