Shachar Lovett

	2012
70		Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures. STOC 2012: 1091-1106
69		Zeev Dvir, Shachar Lovett: Subspace evasive sets. STOC 2012: 351-358
68		Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties CoRR abs/1201.0330: (2012)
67		Zeev Dvir, János Kollár, Shachar Lovett: Variety Evasive Sets CoRR abs/1203.4532: (2012)
66		Shachar Lovett, Raghu Meka: Constructive Discrepancy Minimization by Walking on The Edges CoRR abs/1203.5747: (2012)
65		Abhishek Bhowmick, Zeev Dvir, Shachar Lovett: New Lower Bounds for Matching Vector Codes CoRR abs/1204.1367: (2012)
64		Dmitry Gavinsky, Shachar Lovett, Michael Saks, Srikanth Srinivasan: A Tail Bound for Read-k Families of Functions CoRR abs/1205.1478: (2012)
63		Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random low-degree polynomials are hard to approximate. Computational Complexity 21(1): 63-81 (2012)
62		Arnab Bhattacharyya, Eldar Fischer, Shachar Lovett: Testing Low Complexity Affine-Invariant Properties. Electronic Colloquium on Computational Complexity (ECCC) 19: 1 (2012)
61		Shachar Lovett: An exposition of Sanders quasi-polynomial Freiman-Ruzsa theorem. Electronic Colloquium on Computational Complexity (ECCC) 19: 29 (2012)
60		Abhishek Bhowmick, Zeev Dvir, Shachar Lovett: New Lower Bounds for Matching Vector Codes. Electronic Colloquium on Computational Complexity (ECCC) 19: 34 (2012)
59		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)
58		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)
57		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)
	2011
56		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
55		Tali Kaufman, Shachar Lovett: New Extension of the Weil Bound for Character Sums with Applications to Coding. FOCS 2011: 788-796
54		Shachar Lovett, Emanuele Viola: Bounded-Depth Circuits Cannot Sample Good Codes. IEEE Conference on Computational Complexity 2011: 243-251
53		Arkadev Chattopadhyay, Shachar Lovett: Linear Systems over Finite Abelian Groups. IEEE Conference on Computational Complexity 2011: 300-308
52		Hamed Hatami, Shachar Lovett: Correlation testing for affine invariant properties on Fpn in the high error regime. STOC 2011: 187-194
51		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)
50		Edo Liberty, Shachar Lovett, Omri Weinstein: On the Furthest Hyperplane Problem and Maximal Margin Clustering CoRR abs/1107.1358: (2011)
49		Zeev Dvir, Shachar Lovett: Subspace Evasive Sets CoRR abs/1110.5696: (2011)
48		Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures CoRR abs/1111.0492: (2011)
47		Eli Ben-Sasson, Shachar Lovett, Noga Zewi: An additive combinatorics approach to the log-rank conjecture in communication complexity CoRR abs/1111.5884: (2011)
46		Zeev Dvir, Shachar Lovett: Subspace Evasive Sets. Electronic Colloquium on Computational Complexity (ECCC) 18: 139 (2011)
45		Greg Kuperberg, Shachar Lovett, Ron Peled: Probabilistic existence of rigid combinatorial structures. Electronic Colloquium on Computational Complexity (ECCC) 18: 144 (2011)
44		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)
43		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)
42		Arkadev Chattopadhyay, Shachar Lovett: Linear systems over abelian groups. Electronic Colloquium on Computational Complexity (ECCC) 18: 48 (2011)
41		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)
40		Shachar Lovett: Computing polynomials with few multiplications. Electronic Colloquium on Computational Complexity (ECCC) 18: 94 (2011)
39		Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers Norm is False. Theory of Computing 7(1): 131-145 (2011)
38		Shachar Lovett: Computing Polynomials with Few Multiplications. Theory of Computing 7(1): 185-188 (2011)
	2010
37		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
36		Shachar Lovett, Ely Porat: A Lower Bound for Dynamic Approximate Membership Data Structures. FOCS 2010: 797-804
35		Tali Kaufman, Shachar Lovett, Ely Porat: Weight Distribution and List-Decoding Size of Reed-Muller Codes. ICS 2010: 422-433
34		Parikshit Gopalan, Amir Shpilka, Shachar Lovett: The Complexity of Boolean Functions in Different Characteristics. Computational Complexity 19(2): 235-263 (2010)
33		Shachar Lovett: Equivalence of polynomial conjectures in additive combinatorics. Electronic Colloquium on Computational Complexity (ECCC) 17: 10 (2010)
32		Shachar Lovett, Emanuele Viola: Bounded-depth circuits cannot sample good codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 115 (2010)
31		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)
30		Shachar Lovett: An elementary proof of anti-concentration of polynomials in Gaussian variables. Electronic Colloquium on Computational Complexity (ECCC) 17: 182 (2010)
29		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)
28		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)
27		Shachar Lovett, Ely Porat: A lower bound for dynamic approximate membership data structures. Electronic Colloquium on Computational Complexity (ECCC) 17: 87 (2010)
26		Shachar Lovett: Holes in generalized Reed-Muller codes. IEEE Transactions on Information Theory 56(6): 2583-2586 (2010)
	2009
25		Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377
24		Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630
23		Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. IEEE Conference on Computational Complexity 2009: 173-183
22		Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett: On cryptography with auxiliary input. STOC 2009: 621-630
21		Shachar Lovett: The density of weights of Generalized Reed--Muller codes CoRR abs/0904.0811: (2009)
20		Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness CoRR abs/0911.3473: (2009)
19		Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin: Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. Electronic Colloquium on Computational Complexity (ECCC) 16: 118 (2009)
18		Shachar Lovett: The density of weights of Generalized Reed-Muller codes. Electronic Colloquium on Computational Complexity (ECCC) 16: 30 (2009)
17		Parikshit Gopalan, Shachar Lovett, Amir Shpilka: On the Complexity of Boolean Functions in Different Characteristics. Electronic Colloquium on Computational Complexity (ECCC) 16: 48 (2009)
16		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)
15		Shachar Lovett: Unconditional Pseudorandom Generators for Low Degree Polynomials. Theory of Computing 5(1): 69-82 (2009)
	2008
14		Tali Kaufman, Shachar Lovett: Worst Case to Average Case Reductions for Polynomials. FOCS 2008: 166-175
13		Shachar Lovett: Lower bounds for adaptive linearity tests. STACS 2008: 515-526
12		Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse conjecture for the gowers norm is false. STOC 2008: 547-556
11		Shachar Lovett: Unconditional pseudorandom generators for low degree polynomials. STOC 2008: 557-562
10		Shachar Lovett: Lower bounds for adaptive linearity tests CoRR abs/0802.2857: (2008)
9		Tali Kaufman, Shachar Lovett: The List-Decoding Size of Reed-Muller Codes CoRR abs/0811.2356: (2008)
8		Shachar Lovett, Tali Kaufman: Worst case to Average case reductions for polynomials. Electronic Colloquium on Computational Complexity (ECCC) 15(072): (2008)
7		Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random low degree polynomials are hard to approximate. Electronic Colloquium on Computational Complexity (ECCC) 15(080): (2008)
6		Shachar Lovett, Tali Kaufman: The List-Decoding Size of Reed-Muller Codes. Electronic Colloquium on Computational Complexity (ECCC) 15(111): (2008)
	2007
5		Shachar Lovett, Sasha Sodin: Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits CoRR abs/math/0701102: (2007)
4		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)
3		Shachar Lovett: Unconditional pseudorandom generators for low degree polynomials. Electronic Colloquium on Computational Complexity (ECCC) 14(075): (2007)
2		Shachar Lovett: Tight lower bounds for adaptive linearity tests. Electronic Colloquium on Computational Complexity (ECCC) 14(090): (2007)
1		Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers norm is false. Electronic Colloquium on Computational Complexity (ECCC) 14(123): (2007)

Coauthor Index

1	Noga Alon	[41]
2	Chris Beck (Christopher Beck)	[59]
3	Ido Ben-Eliezer	[7] [19] [20] [25] [63]
4	Eli Ben-Sasson	[44] [47]
5	Arnab Bhattacharyya	[62] [68]
6	Abhishek Bhowmick	[60] [65]
7	Arkadev Chattopadhyay	[42] [53]
8	Yevgeniy Dodis	[22]
9	Zeev Dvir	[46] [49] [60] [65] [67] [69]
10	Eldar Fischer	[62] [68]
11	Dmitry Gavinsky	[58] [64]
12	Parikshit Gopalan	[17] [23] [34]
13	Hamed Hatami	[31] [43] [51] [52]
14	Rani Hod	[7] [25] [63]
15	Russell Impagliazzo	[59]
16	Yael Tauman Kalai (Yael Tauman)	[22]
17	Tali Kaufman	[6] [8] [9] [14] [28] [35] [55] [57]
18	János Kollár	[67]
19	Greg Kuperberg	[45] [48] [70]
20	Edo Liberty	[50]
21	Raghu Meka	[66]
22	Roy Meshulam	[1] [12] [39]
23	Partha Mukhopadhyay	[29] [37]
24	Ron Peled	[45] [48] [70]
25	Ely Porat	[27] [35] [36] [57]
26	Omer Reingold	[24]
27	Michael E. Saks (Michael Saks)	[58] [64]
28	Alex Samorodnitsky	[1] [12] [39]
29	Amir Shpilka	[17] [23] [29] [34] [37]
30	Sasha Sodin	[4] [5]
31	Srikanth Srinivasan	[56] [58] [64]
32	Luca Trevisan	[24]
33	Yoav Tzur	[16]
34	Salil P. Vadhan	[24]
35	Emanuele Viola	[32] [54]
36	Omri Weinstein	[50]
37	Ariel Yadin	[19] [20]
38	Noga Zewi	[44] [47]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page