Homin K. Lee

According to our database, Homin K. Lee authored at least 20 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm.

Charles Masson, Homin K. Lee

CoRR, 2024

Sampling Space-Saving Set Sketches.

Homin K. Lee, Charles Masson

CoRR, 2024

2019

DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees.

Charles Masson, Jee E. Rim, Homin K. Lee

Proc. VLDB Endow., 2019

2011

What Can We Learn Privately?

Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith

SIAM J. Comput., 2011

Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas.

Vitaly Feldman, Homin K. Lee, Rocco A. Servedio

Proceedings of the COLT 2011, 2011

The Efficient Dual Receiver Cryptosystem and Its Applications.

Ted Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung

Int. J. Netw. Secur., 2011

Submodular Functions Are Noise Stable.

Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee

Electron. Colloquium Comput. Complex., 2011

Efficiently Testing Sparse <i>GF</i>(2) Polynomials.

Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan

Algorithmica, 2011

2010

Decision Trees and Influence: an Inductive Proof of the OSSS Inequality.

Homin K. Lee

Theory Comput., 2010

Mansour's Conjecture is True for Random DNF Formulas.

Adam R. Klivans, Homin K. Lee, Andrew Wan

Electron. Colloquium Comput. Complex., 2010

Learning Talagrand DNF Formulas.

Homin K. Lee

Proceedings of the COLT 2010, 2010

2009

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

2008

Efficiently Testing Sparse GF(2) Polynomials.

Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

DNF are teachable in the average case.

Homin K. Lee, Rocco A. Servedio, Andrew Wan

Mach. Learn., 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

Learning Random Monotone DNF.

Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan

Electron. Colloquium Comput. Complex., 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

Cryptographic strength of ssl/tls servers: current and recent practices.

Homin K. Lee, Tal Malkin, Erich M. Nahum

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

2005

ErmineJ: Tool for functional analysis of gene expression data sets.

Homin K. Lee, William Braynen, Kiran Keshav, Paul Pavlidis

BMC Bioinform., 2005

2004

The dual receiver cryptosystem and its applications.

Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung

Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004