Randomness and Computation

Spring 2020

Alice in Randomland
One of the most remarkable developments in Computer Science over the past 30 years has been the realization that the ability of computers to toss coins can lead to algorithms that are more efficient, conceptually simpler and more elegant that their best known deterministic counterparts. Randomization has by now become a ubiquitous tool in computation.

This course will survey several of the most widely used techniques in this context, illustrating them with examples taken from algorithms, random structures and combinatorics. Our goal is to provide a solid background in the key ideas used in the design and analysis of randomized algorithms and probabilistic processes.

Students taking this course should have already completed a good Algorithms courses (with theoretical underpinnings), and have excellent Maths.

Course Information


We will have 5 tutorials during the semester, on weeks weeks 4 (February 5th and 6th), 6, 7, 8 and 10. There are two options, and you may attend whichever you prefer:


Lecture recording will appear in Learn; also I will add direct links to the lecture schedule).


There will be two courseworks in total: the first will be marked and (formative) feedback returned, but will not contribute to the final mark. Deadlines will be:

Course Outline

Here is a rough outline of the course material:


Please read the following guidelines regarding coursework: