Follow
Homin K. Lee
Title
Cited by
Cited by
Year
What can we learn privately?
SP Kasiviswanathan, HK Lee, K Nissim, S Raskhodnikova, A Smith
SIAM Journal on Computing 40 (3), 793-826, 2011
14272011
Coexpression analysis of human genes across many microarray data sets
HK Lee, AK Hsu, J Sajdak, J Qin, P Pavlidis
Genome research 14 (6), 1085-1094, 2004
9402004
ErmineJ: tool for functional analysis of gene expression data sets
HK Lee, W Braynen, K Keshav, P Pavlidis
BMC bioinformatics 6, 1-8, 2005
3342005
Testing for concise representations
I Diakonikolas, HK Lee, K Matulef, K Onak, R Rubinfeld, RA Servedio, ...
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 549-558, 2007
1152007
Cryptographic strength of SSL/TLS servers: Current and recent practices
HK Lee, T Malkin, E Nahum
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement, 83-92, 2007
1092007
Bioinformatic analysis of autism positional candidate genes using biological databases and computational gene network prediction
AL Yonan, AA Palmer, KC Smith, I Feldman, HK Lee, JM Yonan, ...
Genes, Brain and Behavior 2 (5), 303-320, 2003
752003
DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees
C Masson, JE Rim, HK Lee
arXiv preprint arXiv:1908.10693, 2019
602019
The dual receiver cryptosystem and its applications
T Diament, HK Lee, AD Keromytis, M Yung
Proceedings of the 11th ACM conference on Computer and communications …, 2004
582004
Submodular functions are noise stable
HKL Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
57*2012
Mansour's Conjecture is True for Random DNF Formulas.
AR Klivans, HK Lee, A Wan
COLT, 368-380, 2010
362010
What can we learn privately
S Raskhodnikova, A Smith, HK Lee, K Nissim, SP Kasiviswanathan
Proceedings of the 54th Annual Symposium on Foundations of Computer Science …, 2008
312008
Efficiently Testing Sparse GF(2) Polynomials
I Diakonikolas, HK Lee, K Matulef, RA Servedio, A Wan
International Colloquium on Automata, Languages, and Programming, 502-514, 2008
182008
Lower bounds and hardness amplification for learning shallow monotone formulas
V Feldman, HK Lee, RA Servedio
Proceedings of the 24th Annual Conference on Learning Theory, 273-292, 2011
172011
Learning random monotone DNF
JC Jackson, HK Lee, RA Servedio, A Wan
Discrete Applied Mathematics 159 (5), 259-271, 2011
142011
Learning random monotone DNF
JC Jackson, HK Lee, RA Servedio, A Wan
Discrete Applied Mathematics 159 (5), 259-271, 2011
142011
Learning random monotone DNF
JC Jackson, HK Lee, RA Servedio, A Wan
International Workshop on Approximation Algorithms for Combinatorial …, 2008
122008
Optimal cryptographic hardness of learning monotone functions
D Dachman-Soled, HK Lee, T Malkin, RA Servedio, A Wan, H Wee
International Colloquium on Automata, Languages, and Programming, 36-47, 2008
102008
Optimal cryptographic hardness of learning monotone functions
D Dachman-Soled, HK Lee, T Malkin, RA Servedio, A Wan, H Wee
82009
DNF are teachable in the average case
HK Lee, RA Servedio, A Wan
Machine Learning 69, 79-96, 2007
82007
DNF are teachable in the average case
HK Lee, RA Servedio, A Wan
International Conference on Computational Learning Theory, 214-228, 2006
82006
The system can't perform the operation now. Try again later.
Articles 1–20