Theory: Models, and Algorithms

What is this research area about?

Theoretical computer science provides the mathematical foundation for the technological breakthroughs of tomorrow. It supplies the formal models, proof techniques and algorithmic principles that make it possible to design complex systems that are reliable, efficient and secure.

Our research ranges from the development of highly efficient algorithms that can operate autonomously and without a cloud connection, even on resource-constrained devices, to exploring the possibilities of quantum computing as one of the most promising future computing paradigms.

At the heart of this is always the aim of translating profound theory into reliable practice. We work on methods that provide provable guarantees for real-world applications – for example, regarding correctness, runtime, memory requirements or security. These include, amongst others, formal verification, complexity theory, algorithmic design, quantum algorithms and the mathematical analysis of distributed systems.

We establish theoretically sound foundations with practical relevance, enabling new technologies to be deployed securely, transparently and reliably – from classical software systems to the future architectures of the quantum age.