About Me
I am a sixth year Computer Science PhD candidate advised by Steve Homer. Generally, I am interested in Complexity Theory. My main research interest is Boolean Circuit Complexity and the Minimum Circuit Size Problem (MCSP). My recent research has been focused on the structures of optimal circuits.
Before coming to BU, I was a data analyst at John Hancock. I graduated with a BSc in Mathematics from Northeastern University in December 2018.
I enjoy baking and playing video games. When I want to get out of the house I love exploring the city. I also see a lot of plays, musicals, and movies with my husband Joe!

Tim Tharp