Theoretical Computer Science (TCS)
The theme is focused on fundamental questions on all aspects of the theory of computing. This includes current and potential applications.
The theme is focused on fundamental questions on all aspects of the theory of computing. This includes current and potential applications.
Research Topics
Our research covers a relatively wide range of established and emerging fields in Theoretical Computer Science, including algorithms, coding theory, combinatorics on words, cryptography, database theory, decidability, distributed computing, formal languages and automata theory, game theory, graph theory, (algorithmic) learning theory, mathematical logic, scheduling.
Percy Reyes Paredes (PhD student)
Cryptography: cryptographic Boolean functions, planar functions, APN functions, number theory, finite fields, stream ciphers, algebraic aspects of cryptograph
Szymon Lopaciuk (PhD student)
Combinatorics on words and formal language theory.
- Foundations of the Finite Model Theory of Concatenation, EPSRC
- Taming Extended Regular Expressions, DFG
- Geometry in Robotics, Algorithms and Design (GRAnD), Loughborough University
- Mathematical and Algorithmic Methods for Cryptographic functions and sequences, Royal Society Newton Mobility Grant