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.

See a list of current and upcoming seminars

Gary Bennett (PhD student)

Research interests and keywords:

Distributed systems, in particular, the design of distributed algorithms. Keywords: distributed algorithms; graph theory; algorithms.

Dr Joel Day

Research interests and keywords:

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.

Dr Shaheen Fatima (Lecturer)

Research interests and keywords:

AI in general and, in particular, in negotiation and resource allocation in multi-agent systems. Keywords: algorithms; computational complexity; game theory.

Dr Dominik Frydenberger (Lecturer)

Research interests and keywords:

Algorithmic and combinatorial properties of models with repetition operators, applying results to domain specific languages. XML schema inference, graph databases, and IBM’s AQL. Keywords: database theory; formal language theory; combinatorics on words; learning theory.

Laura Hutchinson (PhD student)

Research interests and keywords

Compacting the representation of words by means of Parikh matrices, representations that gives information about the order in which letters in that word appear. Keywords: Parikh representations; matrices; combinatorics on words; complexity.

Dr Robert Mercas (Lecturer)

Research interests and keywords:

Algorithms and combinatorics on sequences, bioinformatics algorithms, and formal Languages. Also trace monoids and pattern inference (learning theory). Keywords: algorithms and combinatorics on sequences; bioinformatics algorithms; formal languages; trace monoids.

Dr Lars Nagel (Lecturer)

Research interests and keywords:

Algorithms and complexity, distributed computing and systems. Keywords: algorithms; complexity; distributed computing; scheduling.

Percy Reyes Paredes (PhD student)

Cryptography: cryptographic Boolean functions, planar functions, APN functions, number theory, finite fields, stream ciphers, algebraic aspects of cryptograph

Dr Daniel Reidenbach (Senior Lecturer)

Research interests and keywords:

Formal language theory, particularly combinatorial and algorithmic properties of patterns in sequences of symbols. Keywords: formal language theory; combinatorics on words; algorithmic learning theory.

Dr Ana Salagean (Senior Lecturer)

Research interests and keywords:

Cryptography and coding theory, particularly on algebraic and algorithmic aspects. Symmetric cryptography, especially stream ciphers, sequences over finite fields and cryptographic Boolean functions. Keywords: symmetric cryptography; sequences over fields; algebraic coding theory.

Szymon Lopaciuk (PhD student)

Combinatorics on words and formal language theory.