I am a postdoc at the Princeton TCS group from September 2019 to August 2020 hosted by Mark Braverman, and a member of Avi Wigderson's group at IAS from september 2020 to August 2021. I am also part of the Simons Collaboration on Algorithms and Geometry.
I was very fortunate to be advised by Venkat Guruswami.
Where Sariel Har-Peled and Mahesh Viswanathan patiently introduced me to research.
Developed a near linear time FPTAS based on Har-Peled and Raichel's net and prune framework for the problem of finding the minimal ball enclosing k geometric objects from a set of n objects.
Proved that for any unary grammar G, there is a polynomial function P and an exponential function E, such that any string s of length n generated by the grammar has either at most P(n) ambiguous parse trees or at least E(n) ambiguous parse trees.