Search the dblp DataBase

Publications of Author

1. Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung
   The dual receiver cryptosystem and its applications. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Computer and Communications Security, 2004, pp:330-343 [Conf]
   
2. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
   Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
   COLT, 2005, pp:637-651 [Conf]
   
3. Homin K. Lee, Rocco A. Servedio, Andrew Wan
   DNF Are Teachable in the Average Case. [Citation Graph (0, 0)][DBLP]
   COLT, 2006, pp:214-228 [Conf]
   
4. Homin K. Lee, William Braynen, Kiran Keshav, Paul Pavlidis
   ErmineJ: Tool for functional analysis of gene expression data sets. [Citation Graph (0, 0)][DBLP]
   BMC Bioinformatics, 2005, v:6, n:, pp:269- [Journal]
   
5. Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan
   Separating Models of Learning from Correlated and Uncorrelated Data. [Citation Graph (0, 0)][DBLP]
   Journal of Machine Learning Research, 2007, v:8, n:, pp:277-290 [Journal]
   
6. 
   Learning Random Monotone DNF. [Citation Graph (, )][DBLP]
   
   
7. 
   Testing for Concise Representations. [Citation Graph (, )][DBLP]
   
   
8. 
   What Can We Learn Privately? [Citation Graph (, )][DBLP]
   
   
9. 
   Efficiently Testing Sparse GF(2) Polynomials. [Citation Graph (, )][DBLP]
   
   
10. 
    Optimal Cryptographic Hardness of Learning Monotone Functions. [Citation Graph (, )][DBLP]
    
    
11. 
    Cryptographic strength of ssl/tls servers: current and recent practices. [Citation Graph (, )][DBLP]
    
    
12. 
    What Can We Learn Privately? [Citation Graph (, )][DBLP]
    
    
13. 
    Efficiently Testing Sparse GF(2) Polynomials [Citation Graph (, )][DBLP]
    
    
14. 
    Testing for Concise Representations. [Citation Graph (, )][DBLP]
    
    
15. 
    Learning Random Monotone DNF. [Citation Graph (, )][DBLP]