Joel completed his PhD in Theoretical Computer Science in 2016 at º¬Ðß²ÝÊÓƵ. He then held a position as a Postdoc in the Dependable Systems group at Kiel University for two years, before returning to º¬Ðß²ÝÊÓƵ as an EPSRC Postdoctoral Prize fellow. He became a lecturer in the Department of Computer Science in 2020.
His research interests revolve around studying combinatorial phenomena in order to better understand algorithmic problems involving descrete sequences over finite sets of symbols (usually called words or strings). Specific topics include word equations and pattern matching problems.
Research areas
- Complexity of string algorithms
- Combinatorics on words
- Formal language theory