Colby Farm's Sunflower Field, Summer 2019

About Me

I am a second year PhD student at Boston University in the Department of Computer Science. I am in the Algorithms and Theory group. Before coming to BU I was a mathematics undergrad over at Northeastern University (Go Huskies!). I graduated in December 2018, and in between starting my PhD and graduating I worked as a data analyst at John Hancock here in Boston.

My hobbies include baking and playing video games, but when I want to get out of the house I also love exploring and walking around the city. I've spent a lot of time here in Boston and so if you're new to the area and you want to ask for directions feel free to reach out to me!

Research Interests

My main research interests include kernelization and approximation algorithms. I am also interested in formal languages and property testing.

I am working with Prof. Steve Homer, looking at lossy kernelization. For more information, see Chapter 23 of Kernelization: Theory of Parameterized Preprocessing.

As part of CS 591 Sublinear Algorithms Fall 2020, Ludmila Glinskih and I began a research project studying the testability of formal language classes. We are continuing this project with the help of Prof. Sofya Raskhodnikova. For a taste of the subject, check out Regular Languages are Testable with a Constant Number of Queries by Alon, Krivelevich, Newman, Szegedy (2001).

Current Teaching Experience (Spring 2021)

I am a Teaching Fellow for CS 330 (Introduction to Analysis of Algorithms).

Past Teaching Experience

Publications

Submitted Papers

Past Ventures

Before coming to BU I was a data analyst at John Hancock. In 2018 I participated in the Coding, Cryptography and Number Theory REU at Clemson University. For a more detailed view of what I've done you can find my CV at the navigation bar at the top of this webpage (last updated January 2020).