Second-year algorithms, concurrency and a proof engineering seminar at Quillbury; a small research group; and talks that come with slides and a recording when the host allows.
1Courses
Lecture notes are written in quire and free to read. The highlighted rows run this term.
| Code | Course | Term | Students |
|---|---|---|---|
| CS2-14 | Algorithms and Data Structures II | Autumn 2026 | 212 |
| CS4-21 | Proof Engineering seminar | Autumn 2026 | 18 |
| CS3-07 | Concurrent Programming | Spring 2027 | 96 |
| CS1-03 | Discrete Mathematics | 2022 to 2024 | 240 |
Table 2. Courses at Quillbury University. Teaching Prize, 2025, for CS2-14.
2Supervision
The group meets on Tuesdays. Everyone presents a proof they find beautiful once a term, and nobody is allowed to say “clearly”.
Open position. One funded PhD place from October 2027, on verified graph algorithms. Applications close 16 January 2027.
- Mei Kawabata, PhD, since 2023 Weak-memory concurrency and the tallow proof
- Jonas Felber, PhD, since 2024 Linearisability checking at scale
- Kofi Mensah-Bright, EdD, co-supervised Visual tools in first-year algorithms
- Adaeze Okonkwo-Hale, MSc by research, 2026 Lazy heaps for sparse graphs
3Talks
Upcoming first. Slides follow within a week of the talk; ask if one is missing.
Compressed graphs, uncompressed proofs Upcoming
Invited talk, Nordvik Theory Day, Nordvik
Shortest paths on k-compressed graphs Upcoming
Paper talk, SAF 2026, Tarnwick
Why your loop is correct Upcoming
Public lecture, Quillbury Town Library
Earlier talks, with slides or a recording
- Slides
Decrease-key is (almost) free
Seminar, Quillbury Theory Seminar
- Slides
Bounded replay finds the bug you missed
Paper talk, WVS 2025, Ossington
- Recording
Teaching invariants with moving pictures
Paper talk, FoCE 2025, Lindhaven
- Slides
Weak memory for the working programmer
Tutorial, CCP 2024, Harwick Bay
Inviting me to speak?
Seminars, summer schools and school visits are all welcome. Send the date, the audience and how long you would like; I answer within a few days.
Lemma 4 (Correspondence). A message that names a concrete question receives a reply within five working days.