I am currently a Ph.D. student at the School of Mathematics at Tel Aviv University. My Ph.D. advisor is Prof. Asaf Shapira. Previously, 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).

Email: guymosko@post.tau.ac.il

A Sparse Regular Approximation Lemma (with A. Shapira), submitted.

Constructing Near Spanning Trees with Few Local Inspections (with R. Levi, D. Ron, R. Rubinfeld and A. Shapira), Random Structures and Algorithms, to appear.

Decomposing a Graph Into Expanding Subgraphs (with A. Shapira), Random Structures and Algorithms, to appear.

An Improved Lower Bound for Arithmetic Regularity (with K. Hosseini, S. Lovett and A. Shapira), Mathematical Proceedings of the Cambridge Philosophical Society 161 (2016), 193-197.

A Short Proof of Gowers' Lower Bound for the Regularity Lemma (with A. Shapira), Combinatorica, 36 (2016), 187-194.

Exact Bounds for Some Hypergraph Saturation Problems (with A. Shapira), Journal of Combinatorial Theory Ser. B 111 (2015), 242-248.

A full version of this paper: (arXiv)Ramsey Theory, Integer Partitions and a New Proof of the Erdos-Szekeres Theorem (with A. Shapira), Advances in Mathematics 262 (2014), 1107-1129.

Complexity Lower Bounds through Balanced Graph Properties, Proc. of the 27th Annual IEEE Conference on Computational Complexity (2012), 159-169.

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)