Thesis Topics
We have a range of perhaps 25 areas in which we can offer thesis topics. Example areas are:
- Graph pattern matching
- Indexing algorithms
- Cardinality estimation
- Join algorithms
- Foundations of programming languages
- Database factorization
- Data provenance
- Pure formal languages (e.g., unambiguity, symbolic automata)
- Data analysis
- Implementing a database engine
- Implementing auto-generation of TCS exercises
- Doing X in Rust, where X = something cool
- Your own topic
Most of these areas offer thesis topics that can range from implementation-oriented to highly theoretical.
Your profile
In order to find a concrete topic, we usually have to work with you for a while to see what fits you.
The following aspects will help this process.
- You have completed TCS 1. This is a hard requirement. If you have serious difficulties with courses such as TCS 1 or Algorithms & Data Structures it is not wise to choose a topic with us.
- You may have stood out in one of our courses (Foundations of Data Management, Theoretical Computer Science 2, Programming in Rust)
If so, you can reach out to us to check if we have any capacity for you. You can reach out to anyone in our team who you feel is closest to the topic or vibe you want. For example, since Matthias is our local Rust guru, please directly contact him concerning Rust-related topics.