Shachar Lovett

	2009
18		Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377
17		Shachar Lovett, Omer Reingold, Luca Trevisan, Salil P. Vadhan: Pseudorandom Bit Generators That Fool Modular Sums. APPROX-RANDOM 2009: 615-630
16		Yevgeniy Dodis, Yael Tauman Kalai, Shachar Lovett: On cryptography with auxiliary input. STOC 2009: 621-630
15		Shachar Lovett: The density of weights of Generalized Reed--Muller codes CoRR abs/0904.0811: (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	Ido Ben-Eliezer	[7] [18]
2	Yevgeniy Dodis	[16]
3	Rani Hod	[7] [18]
4	Yael Tauman Kalai (Yael Tauman)	[16]
5	Tali Kaufman	[6] [8] [9] [14]
6	Roy Meshulam	[1] [12]
7	Omer Reingold	[17]
8	Alex Samorodnitsky	[1] [12]
9	Sasha Sodin	[4] [5]
10	Luca Trevisan	[17]
11	Salil P. Vadhan	[17]

Colors in the list of coauthors