I am currently a postdoctoral researcher in computer science at the University of Oxford, working with Leslie Goldberg in the Algorithms and Complexity Theory group. I am interested in most areas of complexity theory and combinatorics, especially counting complexity and random or extremal graph theory. Currently, I am focusing on analysing the effects of graph structure on the Moran process and exploring the links between approximate counting complexity and decision complexity in a fine-grained setting.
I obtained my PhD in mathematics from the University of Birmingham, supervised by Daniela Kühn and co-supervised by Deryk Osthus. I was awarded the Ratcliffe Prize, awarded annually to a single student studying a science subject. Prior to that, I read Mathematics at the University of Cambridge, leaving with a BA and an MMath (Distinction).