Joseph Swernofsky a PhD student working with Johan Håstad on hardness of approximation of optimization problems. His research includes tensor rank, max cut and max bisection, the unique games conjecture, the sum of squares hierarchy, and linear threshold predicates. Previously, Joseph attended Carnegie Mellon University, where he earned his bachelor's in mathematics in 2012. He returned to the Bay Area, where he grew up, to tutor and work as a software engineer. In summer 2016, Joseph left Google to join Johan's group at KTH. Outside of research, he enjoys competition programming and board games. He is the coach for the ACM ICPC team at KTH.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Graduate Student.