Guy Moshkovitz - homepage

About me

I am currently a postdoc at the Institute for Advanced Study in Princeton. Before that I was a postdoc of the Special Year on Combinatorics and Complexity at Harvard University (at CMSA). Even before that I was a Ph.D. student at the School of Mathematics at Tel Aviv University. My Ph.D. advisor was Prof. Asaf Shapira. I completed my M.Sc. degree at the School of Computer Science under the supervision of Prof. Oded Regev.

My fields of interest include Extremal Graph and Hypergraph Theory, Ramsey Theory, Extremal Set Theory and applications of Combinatorics to Theoretical Computer Science (e.g., Circuit Complexity).


Research Highlights

Extremal Combinatorics:

Theoretical Computer Science:

  • Tight lower bounds for multiple results on expanding subgraphs, matching upper bounds by Arora-Barak-Steurer [J. ACM 2015], Lipton-Rose-Tarjan [SIAM J. Numer. Anal. 1979] and more.

  • A graph-theoretic approach to arithmetic circuit lower bounds, via the polynomial method.



  • Introduction to Discrete Mathematics (2016)

  • Calculus B2 (2014, 2015, 2016)

  • Linear Algebra A1 (2013, 2014, 2015)

  • Differential and Integral Calculus (2012, 2013)

  • Linear Algebra (2012)

Useful links: online paper repositories

Useful links: journals