Complexity Lower Bounds through Balanced Graph Properties. - Guy Moshkovitz (Electron. Colloquium Comput. Complex., 2011)

Constructing Near Spanning Trees with Few Local Inspections. - Reut Levi; Guy Moshkovitz; Dana Ron; Ronitt Rubinfeld; Asaf Shapira (Electron. Colloquium Comput. Complex., 2015)

Exact bounds for some hypergraph saturation problems. - Guy Moshkovitz; Asaf Shapira (J. Comb. Theory B, 2015)

A short proof of Gowers' lower bound for the regularity lemma. - Guy Moshkovitz; Asaf Shapira (Comb., 2016)

Decomposing a graph into expanding subgraphs. - Guy Moshkovitz; Asaf Shapira (Random Struct. Algorithms, 2018)

On Generalized Regularity. - Noga Alon; Guy Moshkovitz (CoRR, 2019)

Traces of hypergraphs. - Noga Alon; Guy Moshkovitz; Noam Solomon (J. Lond. Math. Soc., 2019)

Geometric Rank of Tensors and Subrank of Matrix Multiplication. - Swastik Kopparty; Guy Moshkovitz; Jeroen Zuiddam (Electron. Colloquium Comput. Complex., 2020)

Structure vs. randomness for bilinear maps. - Alex Cohen; Guy Moshkovitz (STOC, 2021)

Limitations on regularity lemmas for clustering graphs. - Noga Alon; Guy Moshkovitz (Adv. Appl. Math., 2021)

An Optimal Inverse Theorem. - Alex Cohen; Guy Moshkovitz (CoRR, 2021)

Sharp Effective Finite-Field Nullstellensatz. - Guy Moshkovitz; Jeffery Yu (Am. Math. Mon., 2023)