Old Employment

Technical University of Munich

Hardness of Polynomial Local Search | June 2018 - August 2018

Worked at the Technical University of Munich researching local search heuristics in a complexity theoretic context. Explored local search algorithms on H-minor free graph families, along with the applicability of relativization and algebraization to quantifying the hardness of PLS, and PLS adjacent classes like CLS, P and FBPP.

Computational Additive Combinatorics

dISTRIBUTION OF ITERATED SUMSETS | January 2019 - May 2019

Worked with Steven J. Miller at Williams College on a computational study the frequency distribution of random n-iterated sumsets, and explored the applicability of data-streaming framework towards studying massively large iterated sumsets. Our results better characterize the behavior of the frequcency distriubution of in random iterated-sumsets as the probability of including each element, p, is varied. We also proposed a simple data-streaming framework for studying such random sets, and discuss the applicability of results in the field of data-streaming algorithms to future investigations into the behavior of random iterated sumsets. Our work was presented at Combinatorics and Additive Number Theory conference (CANT) 2019.

CHIMPS Lab at Carnegie Mellon University

Machine Learning Algorithm for Sensitive Data Identification | June 2017 - August 2017

Worked with CHIMPS lab at Carnegie Mellon School of Computer Science to develop a machine learning based algorithm to identify sensitive data in natural language.