Matthew Anderson
Associate Professor |
 |
Biography
Matt started as a
Visiting Assistant Professor in
the Computer Science department
of Union College in fall 2014, became an Assistant Professor in fall 2019, and was promoted to Associate Professor in fall 2024.
Before joining Union, Matt spent the summer working on Algebraic
Complexity at the The
Technion in Haifa, Israel under the supervision of
Professor Amir
Shpilka. After completing his Ph.D. Matt did post-doctoral research
in Descriptive and Algebraic Complexity at
the University of
Cambridge Computer
Laboratory under the supervision of
Professor Anuj Dawar for
almost two years.
Matthew completed his
Ph.D. thesis Advancing Algebraic
and Logical Approaches to Circuit Lower Bounds
in Computer Sciences at
the University of Wisconsin-Madison
in May 2012 and was advised by
Professor Dieter van
Melkebeek. Matthew completed his Master's Degree
in Computer Science at
the University of Wisconsin-Madison.
Prior to coming to Madison, he received Bachelor's Degrees
in Computer Science
and Physics
from Carnegie Mellon University in
Pittsburgh, PA.
Research Interests
Theory of Computing, Computational Complexity, Algebraic Complexity,
Circuit Complexity, Descriptive Complexity, Derandomization, Lower
Bounds, High Performance Computing, Virtual Reality
