- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c24 |      | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. SODA 2013: 1337-1355 |
| i50 | | Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of regular combinatorial structures. CoRR abs/1302.4295 (2013) |
| i49 | | Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett: Non-malleable Codes from Additive Combinatorics. IACR Cryptology ePrint Archive 2013: 201 (2013) |
| 2012 | ||
| j9 | | Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random low-degree polynomials are hard to approximate. Computational Complexity 21(1): 63-81 (2012) |
| j8 | | Shachar Lovett, Emanuele Viola: Bounded-Depth Circuits Cannot Sample Good Codes. Computational Complexity 21(2): 245-266 (2012) |
| j7 | | Shachar Lovett: Equivalence of polynomial conjectures in additive combinatorics. Combinatorica 32(5): 607-618 (2012) |
| j6 | | Tali Kaufman, Shachar Lovett, Ely Porat: Weight Distribution and List-Decoding Size of Reed-Muller Codes. IEEE Transactions on Information Theory 58(5): 2689-2696 (2012) |
| c23 | | Noga Alon, Shachar Lovett: Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions. APPROX-RANDOM 2012: 350-361 |
| c22 | | Dmitry Gavinsky, Shachar Lovett, Srikanth Srinivasan: Pseudorandom Generators for Read-Once ACC^0. IEEE Conference on Computational Complexity 2012: 287-297 |
| c21 | | Shachar Lovett, Raghu Meka: Constructive Discrepancy Minimization by Walking on the Edges. FOCS 2012: 61-67 |
| c20 | | Chris Beck, Russell Impagliazzo, Shachar Lovett: Large Deviation Bounds for Decision Trees and Sampling Lower Bounds for AC0-Circuits. FOCS 2012: 101-110 |
| c19 | | Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi: An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS 2012: 177-186 |
| c18 | | |
| c17 | | Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures. STOC 2012: 1091-1106 |
| i48 | | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. CoRR abs/1201.0330 (2012) |
| i47 | | |
| i46 | | Shachar Lovett, Raghu Meka: Constructive Discrepancy Minimization by Walking on The Edges. CoRR abs/1203.5747 (2012) |
| i45 | | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett: New Lower Bounds for Matching Vector Codes. CoRR abs/1204.1367 (2012) |
| i44 | | Dmitry Gavinsky, Shachar Lovett, Michael Saks, Srikanth Srinivasan: A Tail Bound for Read-k Families of Functions. CoRR abs/1205.1478 (2012) |
| i43 | | Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. CoRR abs/1212.3849 (2012) |
| i42 | | Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. Electronic Colloquium on Computational Complexity (ECCC) 19: 1 (2012) |
| i41 | | Shachar Lovett: An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem. Electronic Colloquium on Computational Complexity (ECCC) 19: 29 (2012) |
| i40 | | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett: New Lower Bounds for Matching Vector Codes. Electronic Colloquium on Computational Complexity (ECCC) 19: 34 (2012) |
| i39 | | 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) 19: 42 (2012) |
| i38 | | Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan: A Tail Bound for Read-k Families of Functions. Electronic Colloquium on Computational Complexity (ECCC) 19: 51 (2012) |
| i37 | | Chaim Even-Zohar, Shachar Lovett: The Freiman-Ruzsa Theorem in Finite Fields. Electronic Colloquium on Computational Complexity (ECCC) 19: 180 (2012) |
| i36 | | Arnab Bhattacharyya, Eldar Fischer, Hamed Hatami, Pooya Hatami, Shachar Lovett: Every locally characterized affine-invariant property is testable. Electronic Colloquium on Computational Complexity (ECCC) 19: 184 (2012) |
| 2011 | ||
| j5 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers Norm is False. Theory of Computing 7(1): 131-145 (2011) |
| j4 | | Shachar Lovett: Computing Polynomials with Few Multiplications. Theory of Computing 7(1): 185-188 (2011) |
| c16 | | Shachar Lovett, Srikanth Srinivasan: Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 - o(1) Symmetric Gates. APPROX-RANDOM 2011: 640-651 |
| c15 | | Shachar Lovett, Emanuele Viola: Bounded-Depth Circuits Cannot Sample Good Codes. IEEE Conference on Computational Complexity 2011: 243-251 |
| c14 | | Arkadev Chattopadhyay, Shachar Lovett: Linear Systems over Finite Abelian Groups. IEEE Conference on Computational Complexity 2011: 300-308 |
| c13 | | Tali Kaufman, Shachar Lovett: New Extension of the Weil Bound for Character Sums with Applications to Coding. FOCS 2011: 788-796 |
| c12 | | Hamed Hatami, Shachar Lovett: Correlation testing for affine invariant properties on Fpn in the high error regime. STOC 2011: 187-194 |
| i35 | | Hamed Hatami, Shachar Lovett: Correlation Testing for Affine Invariant Properties on $\mathbb{F}_p^n$ in the High Error Regime. CoRR abs/1104.3335 (2011) |
| i34 | | Edo Liberty, Shachar Lovett, Omri Weinstein: On the Furthest Hyperplane Problem and Maximal Margin Clustering. CoRR abs/1107.1358 (2011) |
| i33 | | |
| i32 | | Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures. CoRR abs/1111.0492 (2011) |
| i31 | | Eli Ben-Sasson, Shachar Lovett, Noga Zewi: An additive combinatorics approach to the log-rank conjecture in communication complexity. CoRR abs/1111.5884 (2011) |
| i30 | | Hamed Hatami, Shachar Lovett: Correlation testing for affine invariant properties on Fpn in the high error regime. Electronic Colloquium on Computational Complexity (ECCC) 18: 29 (2011) |
| i29 | | Arkadev Chattopadhyay, Shachar Lovett: Linear systems over abelian groups. Electronic Colloquium on Computational Complexity (ECCC) 18: 48 (2011) |
| i28 | | Noga Alon, Shachar Lovett: Almost k-wise vs. k-wise independent permutations, and uniformity for general group actions. Electronic Colloquium on Computational Complexity (ECCC) 18: 49 (2011) |
| i27 | | Shachar Lovett: Computing polynomials with few multiplications. Electronic Colloquium on Computational Complexity (ECCC) 18: 94 (2011) |
| i26 | | Zeev Dvir, Shachar Lovett: Subspace Evasive Sets. Electronic Colloquium on Computational Complexity (ECCC) 18: 139 (2011) |
| i25 | | Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures. Electronic Colloquium on Computational Complexity (ECCC) 18: 144 (2011) |
| i24 | | 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) 18: 157 (2011) |
| 2010 | ||
| j3 | | Parikshit Gopalan, Amir Shpilka, Shachar Lovett: The Complexity of Boolean Functions in Different Characteristics. Computational Complexity 19(2): 235-263 (2010) |
| j2 | | Shachar Lovett: Holes in generalized Reed-Muller codes. IEEE Transactions on Information Theory 56(6): 2583-2586 (2010) |
| c11 | | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka: Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. FOCS 2010: 695-704 |
| c10 | | |
| c9 | | Tali Kaufman, Shachar Lovett, Ely Porat: Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433 |
| i23 | | Shachar Lovett: Equivalence of polynomial conjectures in additive combinatorics. Electronic Colloquium on Computational Complexity (ECCC) 17: 10 (2010) |
| i22 | | 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) 17: 33 (2010) |
| i21 | | 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) 17: 65 (2010) |
| i20 | | Shachar Lovett, Ely Porat: A lower bound for dynamic approximate membership data structures. Electronic Colloquium on Computational Complexity (ECCC) 17: 87 (2010) |
| i19 | | Shachar Lovett, Emanuele Viola: Bounded-depth circuits cannot sample good codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 115 (2010) |
| i18 | | Hamed Hatami, Shachar Lovett: Higher-order Fourier analysis of Fpn and the complexity of systems of linear forms. Electronic Colloquium on Computational Complexity (ECCC) 17: 181 (2010) |
| i17 | | Shachar Lovett: An elementary proof of anti-concentration of polynomials in Gaussian variables. Electronic Colloquium on Computational Complexity (ECCC) 17: 182 (2010) |
| 2009 | ||
| j1 | | Shachar Lovett: Unconditional Pseudorandom Generators for Low Degree Polynomials. Theory of Computing 5(1): 69-82 (2009) |
| c8 | | Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377 |
| c7 | | Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630 |
| c6 | | Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. IEEE Conference on Computational Complexity 2009: 173-183 |
| c5 | | Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett: On cryptography with auxiliary input. STOC 2009: 621-630 |
| i16 | | |
| i15 | | Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. CoRR abs/0911.3473 (2009) |
| i14 | | Shachar Lovett: The density of weights of Generalized Reed-Muller codes. Electronic Colloquium on Computational Complexity (ECCC) 16: 30 (2009) |
| i13 | | Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. Electronic Colloquium on Computational Complexity (ECCC) 16: 48 (2009) |
| i12 | | Shachar Lovett, Yoav Tzur: Explicit lower bound for fooling polynomials by the sum of small-bias generators. Electronic Colloquium on Computational Complexity (ECCC) 16: 88 (2009) |
| i11 | | Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin: Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. Electronic Colloquium on Computational Complexity (ECCC) 16: 118 (2009) |
| 2008 | ||
| c4 | | Tali Kaufman, Shachar Lovett: Worst Case to Average Case Reductions for Polynomials. FOCS 2008: 166-175 |
| c3 | | |
| c2 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse conjecture for the gowers norm is false. STOC 2008: 547-556 |
| c1 | | Shachar Lovett: Unconditional pseudorandom generators for low degree polynomials. STOC 2008: 557-562 |
| i10 | | |
| i9 | | Tali Kaufman, Shachar Lovett: The List-Decoding Size of Reed-Muller Codes. CoRR abs/0811.2356 (2008) |
| i8 | | Shachar Lovett, Tali Kaufman: Worst case to Average case reductions for polynomials. Electronic Colloquium on Computational Complexity (ECCC) 15(072) (2008) |
| i7 | | Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random low degree polynomials are hard to approximate. Electronic Colloquium on Computational Complexity (ECCC) 15(080) (2008) |
| i6 | | Shachar Lovett, Tali Kaufman: The List-Decoding Size of Reed-Muller Codes. Electronic Colloquium on Computational Complexity (ECCC) 15(111) (2008) |
| 2007 | ||
| i5 | | Shachar Lovett, Sasha Sodin: Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. CoRR abs/math/0701102 (2007) |
| i4 | | Shachar Lovett, Sasha Sodin: Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits. Electronic Colloquium on Computational Complexity (ECCC) 14(012) (2007) |
| i3 | | Shachar Lovett: Unconditional pseudorandom generators for low degree polynomials. Electronic Colloquium on Computational Complexity (ECCC) 14(075) (2007) |
| i2 | | Shachar Lovett: Tight lower bounds for adaptive linearity tests. Electronic Colloquium on Computational Complexity (ECCC) 14(090) (2007) |
| i1 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers norm is false. Electronic Colloquium on Computational Complexity (ECCC) 14(123) (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page