Computer Sciences Dept.

Andrew Morgan

PhD Graduate

Photo of Andrew Morgan


Andrew Morgan is a PhD graduate who was advised by Dieter van Melkebeek. His research interests have lain in computational complexity theory, specifically lower bounds, derandomization, and descriptive complexity, as well as the connections between these and the rest of computational complexity theory. He has also been a veteran teaching assistant for CS 577, the undergraduate algorithms course.

Research Interests

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

Computer Sciences | UW Home