Andrew Morgan is a graduate student at the University of Wisconsin-Madison, advised by Dieter van Melkebeek. His research interests lie in computational complexity theory, specifically circuit lower bounds, derandomization, and resource-bounded Kolmogorov complexity, as well as the connections between these and the rest of computational complexity theory.