Assistant Professor
Nathan Klein works on designing fast, approximately optimal algorithms for computationally hard tasks like the traveling salesperson problem. He employs tools from combinatorics, probability, and the geometry of polynomials, and is especially interested in rounding algorithms: techniques for translating continuous objects to discrete ones. He received his PhD at the University of Washington in 2023 and was a member at the Institute for Advanced Study before joining BU in 2024.
Website: https://nathan–klein.