I am a first year Computer Science PhD student studying at the Department of Computer Science at the University of Warwick. My supervisor is Artur Czumaj. My undergraduate study took place in the same department; I graduated in 2019. I am part of the Theory and Foundations group in the department.
My current research concerns algorithms and lower bounds for subgraph detection in the CONGEST and CONGESTED-CLIQUE models of distributed computation, as well as other problems in these models and related models.
The following topics are of academic interest to me:
- Distributed and parallel algorithms, including communication networks
- Communication complexity, including multi-party and quantum versions
- Algorithmic graph theory
- Extremal graph theory
I have been a teaching assistant on the following modules:
- CS136: Discrete Mathmatics and its Applications I (2019/20)
- CS254: Algorithmic Graph Theory (2019/20)
- Warwick Online Learning Certificate (2019/20)
- CS118: Programming for Computer Scientists (2018/19)
- CS141: Functional Programming (2018/19)
My office is MB4.17, a shared space in the Mathematical Sciences Building at the University of Warwick. I am usually seated near the back, on the left-hand side as you enter.
Due to the current circumstances I do not have access to this office. To arrange a meeting by video call, please email me.