Computer Sciences Dept.

Andrew Morgan

Graduate Student

Photo of Andrew Morgan


Andrew Morgan is a seventh-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 complexity theory. He is also a veteran teaching assistant for CS 577, the undergraduate algorithms course.

Research Interests

Theory of Computing, Computational Complexity. Specifically circuit lower bounds, derandomization, Kolmogorov complexity, and the relationships between these.


Computer Sciences | UW Home