Nathan Harms

Postdoctoral Researcher, EPFL

Nathan Harms is a postdoc at EPFL hosted by Mika Goos, and received his PhD from the University of Waterloo advised by Eric Blais. He is interested in fundamental questions about randomized algorithms, including property testing and communication complexity, and he likes to draw pictures.

Program Visits

Sublinear Algorithms, Summer 2024, Research Fellow
Sublinear Algorithms
Communication complexity, property testing, sublinear algorithms