Guy Moshkovitz

According to our database, Guy Moshkovitz authored at least 15 papers between 2012 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2026

Nearly-polynomial inverse theorem for the U^d norm in degree d+1.

Tomer Milo, Guy Moshkovitz

CoRR, March, 2026

Slice Rank and Partition Rank of the Determinant.

Amichai Lampert, Guy Moshkovitz

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025

A weak regularity lemma for polynomials.

Guy Moshkovitz, Dora Woodruff

CoRR, September, 2025

2023

Sharp Effective Finite-Field Nullstellensatz.

Guy Moshkovitz, Jeffery Yu

Am. Math. Mon., September, 2023

2021

An Optimal Inverse Theorem.

Alex Cohen, Guy Moshkovitz

CoRR, 2021

Limitations on regularity lemmas for clustering graphs.

Noga Alon, Guy Moshkovitz

Adv. Appl. Math., 2021

Structure vs. randomness for bilinear maps.

Alex Cohen, Guy Moshkovitz

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Geometric Rank of Tensors and Subrank of Matrix Multiplication.

Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam

Proceedings of the 35th Computational Complexity Conference, 2020

2019

Traces of hypergraphs.

Noga Alon, Guy Moshkovitz, Noam Solomon

J. Lond. Math. Soc., 2019

On Generalized Regularity.

Noga Alon, Guy Moshkovitz

CoRR, 2019

2016

A short proof of Gowers' lower bound for the regularity lemma.

Guy Moshkovitz, Asaf Shapira

Comb., 2016

2015

Exact bounds for some hypergraph saturation problems.

Guy Moshkovitz, Asaf Shapira

J. Comb. Theory B, 2015

Constructing Near Spanning Trees with Few Local Inspections.

Reut Levi, Guy Moshkovitz, Dana Ron, Ronitt Rubinfeld, Asaf Shapira

Electron. Colloquium Comput. Complex., 2015

Decomposing a Graph Into Expanding Subgraphs.

Guy Moshkovitz, Asaf Shapira

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2012

Complexity Lower Bounds through Balanced Graph Properties.

Guy Moshkovitz

Proceedings of the 27th Conference on Computational Complexity, 2012