This will be an overview of our ongoing work on fast graph programs in the language GP 2. We will present programs which in some cases match the time complexity of graph algorithms in imperative languages. In other cases we need to assume that input graphs have a bounded degree, to reach the speed of conventional algorithms. This will be a one-hour joint talk with Graham Campbell (Newcastle University).

**Zoom registration** and **YouTube Live**: TBA

###### PhD student of Pure Mathematics

I am a second year PhD student of Pure Mathematics at Newcastle University. Previous to this, I was at the University of York working on an research internship, and before that, I was completing my BSc Computer Science and Mathematics. I am working on problems in algebra and theoretical computer science. In particular, I am interested in geometric group theory and word problems, graph and hypergraph transformation, formal languages and automata, string rewriting, and decision problems.