| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shachar Lovett |
An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Chris Beck, Russell Impagliazzo, Shachar Lovett |
Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett |
Testing Low Complexity Affine-Invariant Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett |
New Lower Bounds for Matching Vector Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett |
Random low-degree polynomials are hard to approximate. |
Computational Complexity |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett |
Testing Low Complexity Affine-Invariant Properties |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Raghu Meka |
Constructive Discrepancy Minimization by Walking on The Edges |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett |
New Lower Bounds for Matching Vector Codes |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, János Kollár, Shachar Lovett |
Variety Evasive Sets |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett, Ely Porat |
Weight Distribution and List-Decoding Size of Reed-Muller Codes. |
IEEE Transactions on Information Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace evasive sets. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg Kuperberg, Shachar Lovett, Ron Peled |
Probabilistic existence of rigid combinatorial structures. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Shachar Lovett, Noga Zewi |
An additive combinatorics approach to the log-rank conjecture in communication complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Greg Kuperberg, Shachar Lovett, Ron Peled |
Probabilistic existence of rigid combinatorial structures. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hamed Hatami, Shachar Lovett |
Correlation testing for affine invariant properties on Fpn in the high error regime. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace Evasive Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Shachar Lovett |
Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Shachar Lovett |
Linear systems over abelian groups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Computing polynomials with few multiplications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky |
Inverse Conjecture for the Gowers Norm is False. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett |
Computing Polynomials with Few Multiplications. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Shachar Lovett, Noga Zewi |
An additive combinatorics approach to the log-rank conjecture in communication complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hamed Hatami, Shachar Lovett |
Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Shachar Lovett |
Subspace Evasive Sets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Greg Kuperberg, Shachar Lovett, Ron Peled |
Probabilistic existence of rigid combinatorial structures |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Edo Liberty, Shachar Lovett, Omri Weinstein |
On the Furthest Hyperplane Problem and Maximal Margin Clustering |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Srikanth Srinivasan |
Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
New Extension of the Weil Bound for Character Sums with Applications to Coding. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Emanuele Viola |
Bounded-Depth Circuits Cannot Sample Good Codes. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Shachar Lovett |
Linear Systems over Finite Abelian Groups. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hamed Hatami, Shachar Lovett |
Correlation testing for affine invariant properties on Fpn in the high error regime. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett |
An elementary proof of anti-concentration of polynomials in Gaussian variables. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Emanuele Viola |
Bounded-depth circuits cannot sample good codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Ely Porat |
A lower bound for dynamic approximate membership data structures. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Equivalence of polynomial conjectures in additive combinatorics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
Testing of exponentially large codes, by a new extension to Weil bound for character sums. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hamed Hatami, Shachar Lovett |
Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Amir Shpilka, Shachar Lovett |
The Complexity of Boolean Functions in Different Characteristics. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Holes in generalized Reed-Muller codes. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett, Ely Porat |
Weight Distribution and List-Decoding Size of Reed-Muller Codes. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Ely Porat |
A Lower Bound for Dynamic Approximate Membership Data Structures. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Yoav Tzur |
Explicit lower bound for fooling polynomials by the sum of small-bias generators. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
The density of weights of Generalized Reed-Muller codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin |
Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Unconditional Pseudorandom Generators for Low Degree Polynomials. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett |
The density of weights of Generalized Reed--Muller codes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin |
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett |
Random Low Degree Polynomials are Hard to Approximate. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom Bit Generators That Fool Modular Sums. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett |
On cryptography with auxiliary input. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
auxiliary information, encryption schemes, learning parity with noise, error-correcting codes, randomness extractors, code obfuscation |
| 1 | Shachar Lovett, Tali Kaufman |
Worst case to Average case reductions for polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Rani Hod, Shachar Lovett |
Random low degree polynomials are hard to approximate. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Tali Kaufman |
The List-Decoding Size of Reed-Muller Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
The List-Decoding Size of Reed-Muller Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Lower bounds for adaptive linearity tests |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Lower bounds for adaptive linearity tests. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
Worst Case to Average Case Reductions for Polynomials. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky |
Inverse conjecture for the gowers norm is false. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
gowers norm, multivariate polynomials, low degree tests |
| 1 | Shachar Lovett |
Unconditional pseudorandom generators for low degree polynomials. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
fourier analysis, pseudorandom generators, low degree tests |
| 1 | Shachar Lovett |
Unconditional pseudorandom generators for low degree polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Sasha Sodin |
Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky |
Inverse Conjecture for the Gowers norm is false. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett |
Tight lower bounds for adaptive linearity tests. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Sasha Sodin |
Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits |
CoRR |
2007 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")