Sebastian Berndt is a researcher at the Institute for Theoretical Computer Science at the University of Lübeck. His research interests revolve around intractable problems. On the one hand, he applies these problems to cryptography and steganography to enable secure communication. On the other hand, he tries to solve them with approaches such as approximation algorithms or fixed-parameter-tractability. A fairly up-to-date list of my publications can be found at dblp.
I had the pleasure to work with very talented researchers. In alphabetical order, they are
Diego F. Aranha, Ida Bruhns, Max Bannach, Pascal Bemmann, Hauke Brinkop, Rongmao Chen, Chitchanok Chuengsatiansup, Max Deppert, Denis Diemert, Valentin Dreismann, Franziska Eberle, Thorsten Ehlers, Thomas Eisenbarth, Leah Epstein, Sebastian Faust, Marc Gourjon, Kilian Grage, Tibor Jager, Klaus Jansen, Lukas Johannsen, Kim-Manuel Klein, Ingmar Knof, Maria Kosche, Alexandra Lassota, Asaf Levin, Maciej Liśkiewicz, Matthias Lutter, Marten Maack, Nicole Megow, Matthias Mnich, Dirk Nowotka, Maximilian Orlt, Claudius Pott, Malin Rau, Rüdiger Reischuk, Lars Rohwedder, Jonas Sander, Okan Seker, Florian Sieck, Malte Skambath, Tobias Stamm, Akira Takahashi, Thore Tiemann, Tim-Henrik Traving, Jan Wichelmann, Luca Wilke, Yuval Yarom, Greg Zaverucha, Zhiyuan Zhang
PhD in Computer Science (summa cum laude), 2018
University of Lübeck
M.Sc. in Computer Science, 2012
BSc in Computer Science, 2010