7 citations · 11 across the 3 of their papers we have counts for
3 papers
math.CO2014★ 7 cited
An Improved Lower Bound for Arithmetic Regularity
Kaave Hosseini, Shachar Lovett, Guy Moshkovitz +1
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemer{é}di regularity lemma in graph theory. It shows that for any abelian group and any…
cs.CC2014★ 4 cited
Recent advances on the log-rank conjecture in communication complexity
Shachar Lovett
The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function…
cs.CC2011
Subspace Evasive Sets
Zeev Dvir, Shachar Lovett
In this work we describe an explicit, simple, construction of large subsets of F^n, where F is a finite field, that have small intersection with every k-dimensional affine subspace…