Computer Science

Research

technical diagram

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.

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.

For a list of current and upcoming seminars, see here.

Group members

Gary Bennett (PhD student)

Gary's research focus is on distributed systems, in particular, the design of distributed algorithms.

Keywords: distributed algorithms; graph theory; algorithms.

Dr. Shaheen Fatima (Lecturer)

Shaheen is interested in AI in general and, in particular, in negotiation and resource allocation in multi-agent systems.

Keywords: algorithms; computational complexity; game theory.

Dr. Dominik D. Freydenberger (Lecturer)

Dominik’s research focusses on the algorithmic and combinatorial properties of models with repetition operators, and on how these results can be applied to domain specific languages. Examples of these applications include the back-reference operator of most modern regex implementations, XML schema inference, graph databases, and IBM’s AQL (a query language for information extraction).

Keywords: database theory; formal language theory; combinatorics on words; learning theory.

Viktor Henriksson (PhD Student)

B.V.D.Henriksson@lboro.ac.uk

Laura K. Hutchinson (PhD Student)

Laura’s research focusses on 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. Manfred Kufleitner (Lecturer)

Manfred’s research covers a broad range of topics in Theoretical Computer Science. This includes formal verification, automata and formal languages, the theory of finite semigroups, algorithms and combinatorics on words, and text compression. His current work focusses on logic fragments for sequential and concurrent systems.

Keywords: automata theory; logic in computer science; formal languages; semigroups; combinatorics on words.

Dr. Robert Mercaș (Lecturer)

Robert’s research interest covers algorithms and combinatorics on sequences, bioinformatics algorithms, and formal Languages. He is also interested in trace monoids and pattern inference (learning theory), while some ago he published work related to the formalism of networks of processors, and that of natural language processing.

Keywords: algorithms and combinatorics on sequences; bioinformatics algorithms; formal languages; trace monoids.

Dr. Lars Nagel (Lecturer)

Lars’s interest spans over algorithms and complexity, as well as distributed computing and systems.

Keywords: algorithms; complexity; distributed computing; scheduling.

Dr. Daniel Reidenbach (Senior Lecturer)

Daniel's research is primarily within formal language theory, and he is particularly interested in combinatorial and algorithmic properties of patterns in sequences of symbols.

Keywords: formal language theory; combinatorics on words; algorithmic learning theory.

Dr. Ana Sălăgean (Senior Lecturer)

Ana works in the area of cryptography and coding theory, particularly on algebraic and algorithmic aspects. In cryptography her interests are in symmetric cryptography, and especially stream ciphers, sequences over finite fields and cryptographic Boolean functions.

Keywords: symmetric cryptography; sequences over fields; algebraic coding theory.

Alex M.S. Smith (PhD Student)

Alex's research interests are in combinatorics on words and formal language theory, in particular in relation to patterns, morphisms, decidability, complexity and avoidability.

Keywords: combinatorics on words; decidability; formal languages; complexity theory.

Dr. Amitabh Trehan (Lecturer)

Amitabh's research interests are in designing and mathematically analysing algorithms and reasoning about multi-agent dynamic scenarios and complexity. A major direction of his research is on message passing distributed algorithms, especially resilient self-healing algorithms but he also explores game theory, algorithms at large, and parametrised and communication complexity.

Keywords: algorithms at large; distributed algorithms; game theory; graph theory; self-healing and other resilient, dynamic algorithms.