Open Topics for Bachelor and Master Theses

We always welcome motivated students who want to write a thesis or student project in our group.

Usually, the topics that we offer are closely related to our ongoing research projects. As these change over time, we usually do not offer a thesis topic to be written 'sometimes in the future'. Thus, you should contact us at most a couple of weeks before you actually want to start writing your thesis.

For a Bachelor thesis we usually require that you have successfully passed either the course Algorithms, Probability, and Computing or the course Randomized Algorithms and Probabilistic Methods. For a Master thesis we always require that you have passed Randomized Algorithms and Probabilistic Methods (or something equivalent in exceptional cases). Please note that students of D-INFK have preference over students from other departments. Due to the current high numbers of computer science students this means that typically we will only be able to offer theses topics to students from other departments if they are exceptionally qualified.

Currently, we offer thesis topics within the following areas:

Some specific topics are listed below. Note, however, that this list is not exclusive, we usually have more topics available: please do contact Angelika Steger or any member of our group to find out more about possible topics. If you have your own ideas or interests, you are also welcome to contact us and talk about possibilities for a tailor-made topic.

Specific open topics:

Finding Sequence Ensembles in Random Structures

Understanding the Spatial Code in Mammalian Brain

Counterfactual Learning of Recurrent Neural Networks

Maker Breaker Triangle Game

Resilience of random bipartite graphs (Bachelor/Master Thesis)
In particular:

Disclaimer: The resilience/embedding topics may be difficult and are intended for highly motivated students. For more information (and similar problems) contact Miloš Trujić.

Please also consult our guidelines if you are considering writing a thesis with us.