The SCEAS System
| |||||||

## Search the dblp DataBase
Enav Weinreb:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Amos Beimel, Enav Weinreb
**Monotone Circuits for Weighted Threshold Functions.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:67-75 [Conf] - Amos Beimel, Enav Weinreb
**Separating the Power of Monotone Span Programs over Different Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:428-437 [Conf] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private approximation of search problems.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:119-128 [Conf] - Kobbi Nissim, Enav Weinreb
**Communication Efficient Secure Linear Algebra.**[Citation Graph (0, 0)][DBLP] TCC, 2006, pp:522-541 [Conf] - Amos Beimel, Tamir Tassa, Enav Weinreb
**Characterizing Ideal Weighted Threshold Secret Sharing.**[Citation Graph (0, 0)][DBLP] TCC, 2005, pp:600-619 [Conf] - Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin
**Secure Linear Algebra Using Linearly Recurrent Sequences.**[Citation Graph (0, 0)][DBLP] TCC, 2007, pp:291-310 [Conf] - Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
**Private Approximation of Search Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:141, pp:- [Journal] - Amos Beimel, Enav Weinreb
**Monotone circuits for monotone weighted threshold functions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:1, pp:12-18 [Journal] - Amos Beimel, Enav Weinreb
**Separating the Power of Monotone Span Programs over Different Fields.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1196-1215 [Journal] - Omer Barkol, Yuval Ishai, Enav Weinreb
**On Locally Decodable Codes, Self-correctable Codes, and**[Citation Graph (0, 0)][DBLP]*t*-Private PIR. APPROX-RANDOM, 2007, pp:311-325 [Conf] - Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
**How Should We Solve Search Problems Privately?**[Citation Graph (0, 0)][DBLP] CRYPTO, 2007, pp:31-49 [Conf] **Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.**[Citation Graph (, )][DBLP]**Secure Linear Algebra Using Linearly Recurrent Sequences.**[Citation Graph (, )][DBLP]**The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.**[Citation Graph (, )][DBLP]**Partition Arguments in Multiparty Communication Complexity.**[Citation Graph (, )][DBLP]**Choosing, Agreeing, and Eliminating in Communication Complexity.**[Citation Graph (, )][DBLP]**Communication in the presence of replication.**[Citation Graph (, )][DBLP]**On the complexity of communication complexity.**[Citation Graph (, )][DBLP]**Partition Arguments in Multiparty Communication Complexity**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |