Per Austrin

Per Austrin is a Lecturer at the Royal Institute of Technology (KTH) in the Department of Theoretical Computer Science. He has been actively involved in teaching courses such as Algorithms and Complexity (DD2352), Advanced Algorithms (DD2440), and Problem Solving and Programming Under Pressure (DD2458), serving as examiner and course coordinator for several programs.

His research focuses on the foundations of computational complexity, approximation algorithms, and cryptographic barriers. Key areas include hardness of approximation for constraint satisfaction problems (CSPs), combinatorial optimization, and theoretical limits in cryptography and coding theory. His work often intersects with probabilistic methods and quantum computing challenges.

Recent publications highlight his contributions to understanding lower bounds in optimization problems, inapproximability thresholds, and complexity in structured combinatorial problems. Detailed information about his work can be found on his personal website: Per Austrin's Website.