I received my PhD from Department of Computer Science, University of Toronto under supervision of Toniann Pitassi.
My area of research was Theoretical Computer Science: Combinatorial Optimization, Approximation Algorithms and Complexity Theory in general and Linear programming and Semidefinite programming relaxations, their integrality gaps and their application to Combinatorial Optimization problems in particular.

Publications

An Isoperimetric Inequality for the Hamming Cube with Applications for Integrality Gaps in Degree-bounded Graphs, with Hamed Hatami and Avner Magen.
in preparation.