I am a third-year PhD student in Computer Science at Columbia University, where I am advised by Augustin Chaintreau and Cliff Stein. Broadly speaking, I am interested in {social networks, fairness, redistricting, and elections}. Other things I think are cool include {spatial/geographic data, online graph algorithms, and computational social science (broadly speaking)}.
As of summer 2025, I'm working on projects on [asymptotics of node embeddings and implications for fairness] and [individually-fair scheduling algorithms].
Prior to Columbia, I spent one year as a staff researcher at Duke, working with Jonathan Mattingly and Greg Herschlag on using hierarchical MCMC methods to sample Congressional districting plans. I did my undergrad at CMU, where I got concentrations in Algorithms & Complexity and Robotics and worked with Anupam Gupta on online perfect matchings with deadlines. Before that, I spent a summer at NASA's Ames Research Center and a few semesters working in the Biorobotics lab at CMU.
Outside of work, I enjoy drawing (I post on instagram), hiking, and playing board games (recent favorites: Ark Nova, Concordia, Wingspan). I am also on the student board of the Columbia Catholic Ministry.
I am supported by the NSF Graduate Research Fellowship.
I find great joy in teaching undergrad-level CS to students new to formal mathematics, especially topics that have to do with discrete math, proofs, and Functional Programming. I have TA'd in the following capacities:
gtc2117 [at] columbia [dot] edu, Google Scholar, LinkedIn, Twitter/X