Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Homin K. Lee
2010 – today
- 2012
[c12]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular functions are noise stable. SODA 2012: 1586-1592- 2011
- [j10]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. Algorithmica 61(3): 580-605 (2011)
- [j9]Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning random monotone DNF. Discrete Applied Mathematics 159(5): 259-271 (2011)
- [j8]Ted Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung: The Efficient Dual Receiver Cryptosystem and Its Applications. I. J. Network Security 13(3): 135-151 (2011)
- [j7]Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Journal of Machine Learning Research - Proceedings Track 19: 273-292 (2011)
- [j6]Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? SIAM J. Comput. 40(3): 793-826 (2011)
- [i8]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable. CoRR abs/1106.0518 (2011)
- [i7]Mahdi Cheraghchi, Adam Klivans, Pravesh Kothari, Homin K. Lee: Submodular Functions Are Noise Stable. Electronic Colloquium on Computational Complexity (ECCC) 18: 90 (2011)
- 2010
- [j5]Homin K. Lee: Decision Trees and Influence: an Inductive Proof of the OSSS Inequality. Theory of Computing 6(1): 81-84 (2010)
- [c11]
- [c10]Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. COLT 2010: 368-380
- [i6]Vitaly Feldman, Homin K. Lee, Rocco A. Servedio: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 22 (2010)
- [i5]Adam R. Klivans, Homin K. Lee, Andrew Wan: Mansour's Conjecture is True for Random DNF Formulas. Electronic Colloquium on Computational Complexity (ECCC) 17: 23 (2010)
2000 – 2009
- 2009
- [j4]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. Theory of Computing 5(1): 257-282 (2009)
- 2008
- [c9]Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning Random Monotone DNF. APPROX-RANDOM 2008: 483-497
- [c8]Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? FOCS 2008: 531-540
- [c7]Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee: Optimal Cryptographic Hardness of Learning Monotone Functions. ICALP (1) 2008: 36-47
- [c6]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. ICALP (1) 2008: 502-514
- [i4]Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith: What Can We Learn Privately? CoRR abs/0803.0924 (2008)
- [i3]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan: Efficiently Testing Sparse GF(2) Polynomials. CoRR abs/0805.1765 (2008)
- 2007
- [j3]Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Separating Models of Learning from Correlated and Uncorrelated Data. Journal of Machine Learning Research 8: 277-290 (2007)
- [j2]Homin K. Lee, Rocco A. Servedio, Andrew Wan: DNF are teachable in the average case. Machine Learning 69(2-3): 79-96 (2007)
- [c5]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. FOCS 2007: 549-558
- [c4]Homin K. Lee, Tal Malkin, Erich M. Nahum: Cryptographic strength of ssl/tls servers: current and recent practices. Internet Measurement Comference 2007: 83-92
- [i2]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan: Testing for Concise Representations. Electronic Colloquium on Computational Complexity (ECCC) 14(077) (2007)
- [i1]Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Learning Random Monotone DNF. Electronic Colloquium on Computational Complexity (ECCC) 14(129) (2007)
- 2006
- [c3]Homin K. Lee, Rocco A. Servedio, Andrew Wan: DNF Are Teachable in the Average Case. COLT 2006: 214-228
- 2005
- [j1]Homin K. Lee, William Braynen, Kiran Keshav, Paul Pavlidis: ErmineJ: Tool for functional analysis of gene expression data sets. BMC Bioinformatics 6: 269 (2005)
- [c2]Ariel Elbaz, Homin K. Lee, Rocco A. Servedio, Andrew Wan: Separating Models of Learning from Correlated and Uncorrelated Data. COLT 2005: 637-651
- 2004
- [c1]Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung: The dual receiver cryptosystem and its applications. ACM Conference on Computer and Communications Security 2004: 330-343
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-20 21:54 CET by the dblp team