The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Enav Weinreb: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
    Private approximation of search problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:119-128 [Conf]
  4. Kobbi Nissim, Enav Weinreb
    Communication Efficient Secure Linear Algebra. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:522-541 [Conf]
  5. Amos Beimel, Tamir Tassa, Enav Weinreb
    Characterizing Ideal Weighted Threshold Secret Sharing. [Citation Graph (0, 0)][DBLP]
    TCC, 2005, pp:600-619 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Omer Barkol, Yuval Ishai, Enav Weinreb
    On Locally Decodable Codes, Self-correctable Codes, and t -Private PIR. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:311-325 [Conf]
  11. 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]

  12. Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. [Citation Graph (, )][DBLP]


  13. Secure Linear Algebra Using Linearly Recurrent Sequences. [Citation Graph (, )][DBLP]


  14. The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. [Citation Graph (, )][DBLP]


  15. Partition Arguments in Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


  16. Choosing, Agreeing, and Eliminating in Communication Complexity. [Citation Graph (, )][DBLP]


  17. Communication in the presence of replication. [Citation Graph (, )][DBLP]


  18. On the complexity of communication complexity. [Citation Graph (, )][DBLP]


  19. Partition Arguments in Multiparty Communication Complexity [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002