Andrew Morgan is a sixth-year graduate student advised by
Dieter van Melkebeek.
His research interests lie in computational complexity theory,
specifically circuit lower bounds, derandomization, and Kolmogorov complexity,
as well as the connections between these and the rest of computational
He is also a veteran teaching assistant for CS 577, the undergraduate
Theory of Computing, Computational Complexity. Specifically circuit lower bounds,
derandomization, Kolmogorov complexity, and the relationships between these.