I am a graduate student in the UCLA math department working in mathematical logic, specifically set theory, also with interests in theoretical computer science.My advisor is Itay Neeman.
Comparisons of polychromatic and monochromatic Ramsey theory. (Accepted to the Journal of Symbolic Logic)
Unbounded and dominating reals in Hechler extensions. The Journal of Symbolic Logic, Vol. 8, No 1, 2013, pp 275-289
(with Joel David Hamkins) The rigid relation principle, a new weak choice principle. Mathematical Logic Quarterly, Vol. 58, No 6, 2012, pp 394-398
Papers Outside of Set Theory:
(with F. Blanchet-Sadri, Raphaël Jungers) Testing avoidability on sets of partial words is hard. Theoretical Computer Science, Vol. 410, 2009, pp 968-972.
(with F. Blanchet-Sadri, N.C. Brownstein, A. Kalcic and and T. Weyand) Unavoidable sets of partial words. Theory of Computing Systems, Vol. 45, No. 2, 2009, 381-406.
(with F. Blanchet-Sadri and N.C. Brownstein) Two element unavoidable sets of partial words. In T. Harju, J. Karhumäki, and A. Lepistö (Eds), DLT 2007, 11th International Conference on Developments in Language Theory, July 3-6, 2007, Turku, Finland, Lectures Notes in Computer Science, Vol. 4588, Springer-Verlag, Berlin, Heidelberg, 2007, pp 96-107.