The dual receiver cryptosystem and its applications. - Theodore Diament; Homin K. Lee; Angelos D. Keromytis; Moti Yung (CCS, 2004)

ErmineJ: Tool for functional analysis of gene expression data sets. - Homin K. Lee; William Braynen; Kiran Keshav; Paul Pavlidis (BMC Bioinform., 2005)

Cryptographic strength of ssl/tls servers: current and recent practices. - Homin K. Lee; Tal Malkin; Erich M. Nahum (Internet Measurement Conference, 2007)

Testing for Concise Representations. - Ilias Diakonikolas; Homin K. Lee; Kevin Matulef; Krzysztof Onak; Ronitt Rubinfeld; Rocco A. Servedio; Andrew Wan (Electron. Colloquium Comput. Complex., 2007)

Separating Models of Learning from Correlated and Uncorrelated Data. - Ariel Elbaz; Homin K. Lee; Rocco A. Servedio; Andrew Wan (J. Mach. Learn. Res., 2007)

DNF are teachable in the average case. - Homin K. Lee; Rocco A. Servedio; Andrew Wan (Mach. Learn., 2007)

Efficiently Testing Sparse GF(2) Polynomials. - Ilias Diakonikolas; Homin K. Lee; Kevin Matulef; Rocco A. Servedio; Andrew Wan (ICALP (1), 2008)

Optimal Cryptographic Hardness of Learning Monotone Functions. - Dana Dachman-Soled; Homin K. Lee; Tal Malkin; Rocco A. Servedio; Andrew Wan; Hoeteck Wee (Theory Comput., 2009)

Learning Talagrand DNF Formulas. - Homin K. Lee (COLT, 2010)

Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. - Vitaly Feldman; Homin K. Lee; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2010)

Mansour's Conjecture is True for Random DNF Formulas. - Adam R. Klivans; Homin K. Lee; Andrew Wan (Electron. Colloquium Comput. Complex., 2010)

Decision Trees and Influence: an Inductive Proof of the OSSS Inequality. - Homin K. Lee (Theory Comput., 2010)

Efficiently Testing Sparse GF(2) Polynomials. - Ilias Diakonikolas; Homin K. Lee; Kevin Matulef; Rocco A. Servedio; Andrew Wan (Algorithmica, 2011)

Learning random monotone DNF. - Jeffrey C. Jackson; Homin K. Lee; Rocco A. Servedio; Andrew Wan (Discret. Appl. Math., 2011)

Submodular Functions Are Noise Stable. - Mahdi Cheraghchi; Adam R. Klivans; Pravesh Kothari; Homin K. Lee (Electron. Colloquium Comput. Complex., 2011)

The Efficient Dual Receiver Cryptosystem and Its Applications. - Ted Diament; Homin K. Lee; Angelos D. Keromytis; Moti Yung (Int. J. Netw. Secur., 2011)

What Can We Learn Privately? - Shiva Prasad Kasiviswanathan; Homin K. Lee; Kobbi Nissim; Sofya Raskhodnikova; Adam D. Smith 001 (SIAM J. Comput., 2011)

DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees. - Charles Masson; Jee E. Rim; Homin K. Lee (Proc. VLDB Endow., 2019)

Sampling Space-Saving Set Sketches. - Homin K. Lee; Charles Masson (CoRR, 2024)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm. - Charles Masson; Homin K. Lee (CoRR, 2024)