Enav Weinreb

	2009
19		Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402
18		Eyal Kushilevitz, Enav Weinreb: On the complexity of communication complexity. STOC 2009: 465-474
17		Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity CoRR abs/0909.5684: (2009)
	2008
16		Payman Mohassel, Enav Weinreb: Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. CRYPTO 2008: 481-496
15		Omer Barkol, Yuval Ishai, Enav Weinreb: Communication in the presence of replication. STOC 2008: 661-670
14		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008)
13		Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. SIAM J. Discrete Math. 22(1): 360-397 (2008)
	2007
12		Omer Barkol, Yuval Ishai, Enav Weinreb: On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. APPROX-RANDOM 2007: 311-325
11		Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb: How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49
10		Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin: Secure Linear Algebra Using Linearly Recurrent Sequences. TCC 2007: 291-310
	2006
9		Eike Kiltz, Enav Weinreb: Secure Linear Algebra Using Linearly Recurrent Sequences. Complexity of Boolean Functions 2006
8		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private approximation of search problems. STOC 2006: 119-128
7		Kobbi Nissim, Enav Weinreb: Communication Efficient Secure Linear Algebra. TCC 2006: 522-541
6		Amos Beimel, Enav Weinreb: Monotone circuits for monotone weighted threshold functions. Inf. Process. Lett. 97(1): 12-18 (2006)
	2005
5		Amos Beimel, Enav Weinreb: Monotone Circuits for Weighted Threshold Functions. IEEE Conference on Computational Complexity 2005: 67-75
4		Amos Beimel, Tamir Tassa, Enav Weinreb: Characterizing Ideal Weighted Threshold Secret Sharing. TCC 2005: 600-619
3		Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb: Private Approximation of Search Problems Electronic Colloquium on Computational Complexity (ECCC)(141): (2005)
2		Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. SIAM J. Comput. 34(5): 1196-1215 (2005)
	2003
1		Amos Beimel, Enav Weinreb: Separating the Power of Monotone Span Programs over Different Fields. FOCS 2003: 428-437

Coauthor Index

1	Omer Barkol	[12] [15]
2	Amos Beimel	[1] [2] [3] [4] [5] [6] [8] [11] [13] [14]
3	Paz Carmi	[3] [8] [14]
4	Jan Draisma	[17] [19]
5	Matthew K. Franklin	[10]
6	Yuval Ishai	[12] [15]
7	Eike Kiltz	[9] [10]
8	Eyal Kushilevitz	[17] [18] [19]
9	Tal Malkin	[11]
10	Payman Mohassel	[10] [16]
11	Kobbi Nissim	[3] [7] [8] [11] [14]
12	Tamir Tassa	[4] [13]