Thekla Hamm

Thekla Hamm serves as an Assistant Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology, specializing in Graph Algorithms. Her academic profile demonstrates strong engagement with theoretical computer science concepts and computational complexity theory.

Her research interests span multiple interconnected domains of theoretical computer science, with primary focus on Graph Algorithms and Turing Machines. Secondary research areas include Quantum Computation, Model of Computation, Real Polynomials, Polynomial Time complexity, and Discrete Models. These research interests form a cohesive fingerprint that positions her work at the intersection of classical and quantum computational models.

Hamm's recent scholarly output shows active contribution to the field, with a preprint publication in early 2025 titled 'Oracle Separations for RPH' that explores fundamental questions in computational complexity. This work connects Turing Machine theory with polynomial-time computation models, suggesting ongoing contributions to theoretical foundations of computer science.

Hamm supervises academic work as indicated by the 'Supervised Work (1)' notation in her profile, though specific student names or projects aren't detailed in the available information. She has been teaching two significant courses since 2013 and 2017 respectively: 'Algorithms' and 'Exact Algorithms for NP-hard Problems,' demonstrating sustained commitment to computer science education.