Alexandros Hollender

BSc, MSc
Post-Doctoral Research Fellow from 2021

My research in theoretical computer science mainly lies in the field of algorithms and computational complexity, which studies the inherent hardness in solving some computational problems. I am particularly interested in “total search problems”, which arise naturally in many applications, such as game theory, optimization, cryptography, and many more.