About Me

I am a first year Ph.D student studying Computer Science at University of Texas at Austin, advised by Prof. Dana Moshkovitz. My research is mainly focused on algorithms and complexity theory, especially in Hardness of Approximation.

My current projects is about FPT (fixed parameter tractable) inapproximability, including the hardness results for k-Clique and other interesting problem in fine-grained complexity.

I am also interested in topics such as pseudorandomness, coding theory and graph isomorphism.