Guy Moshkovitz

According to our database1, Guy Moshkovitz authored at least 14 papers between 2012 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
A weak regularity lemma for polynomials.
CoRR, September, 2025

Slice rank and partition rank of the determinant.
CoRR, September, 2025

2023
Sharp Effective Finite-Field Nullstellensatz.
Am. Math. Mon., September, 2023

2021
An Optimal Inverse Theorem.
CoRR, 2021

Limitations on regularity lemmas for clustering graphs.
Adv. Appl. Math., 2021

Structure vs. randomness for bilinear maps.
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.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Traces of hypergraphs.
J. Lond. Math. Soc., 2019

On Generalized Regularity.
CoRR, 2019

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

2015
Exact bounds for some hypergraph saturation problems.
J. Comb. Theory B, 2015

Constructing Near Spanning Trees with Few Local Inspections.
Electron. Colloquium Comput. Complex., 2015

Decomposing a Graph Into Expanding Subgraphs.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2012
Complexity Lower Bounds through Balanced Graph Properties.
Proceedings of the 27th Conference on Computational Complexity, 2012


  Loading...