default search action
Homin K. Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Homin K. Lee, Charles Masson:
Sampling Space-Saving Set Sketches. CoRR abs/2402.08604 (2024) - [i10]Charles Masson, Homin K. Lee:
FlipHash: A Constant-Time Consistent Range-Hashing Algorithm. CoRR abs/2402.17549 (2024)
2010 – 2019
- 2019
- [j10]Charles Masson, Jee E. Rim, Homin K. Lee:
DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees. Proc. VLDB Endow. 12(12): 2195-2205 (2019) - [i9]Charles Masson, Jee E. Rim, Homin K. Lee:
DDSketch: A fast and fully-mergeable quantile sketch with relative-error guarantees. CoRR abs/1908.10693 (2019) - 2012
- [c13]Mahdi Cheraghchi
, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular functions are noise stable. SODA 2012: 1586-1592 - 2011
- [j9]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan:
Efficiently Testing Sparse GF(2) Polynomials. Algorithmica 61(3): 580-605 (2011) - [j8]Jeffrey C. Jackson
Learning random monotone DNF. Discret. Appl. Math. 159(5): 259-271 (2011) - [j7]Ted Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung:
The Efficient Dual Receiver Cryptosystem and Its Applications. Int. J. Netw. Secur. 13(3): 135-151 (2011) - [j6]Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam D. Smith:
What Can We Learn Privately? SIAM J. Comput. 40(3): 793-826 (2011) - [c12]Vitaly Feldman, Homin K. Lee, Rocco A. Servedio:
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas. COLT 2011: 273-292 - [i8]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. CoRR abs/1106.0518 (2011) - [i7]Mahdi Cheraghchi, Adam R. Klivans, Pravesh Kothari, Homin K. Lee:
Submodular Functions Are Noise Stable. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j5]Homin K. Lee:
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality. Theory Comput. 6(1): 81-84 (2010) - [c11]Homin K. Lee:
Learning Talagrand DNF Formulas. COLT 2010: 310-311 - [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. Electron. Colloquium Comput. Complex. TR10 (2010) - [i5]Adam R. Klivans, Homin K. Lee, Andrew Wan:
Mansour's Conjecture is True for Random DNF Formulas. Electron. Colloquium Comput. Complex. TR10 (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 Comput. 5(1): 257-282 (2009) - 2008
- [c9]Jeffrey C. Jackson
Learning Random Monotone DNF. APPROX-RANDOM 2008: 483-497 - [c8]Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim
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 D. 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. J. Mach. Learn. Res. 8: 277-290 (2007) - [j2]Homin K. Lee, Rocco A. Servedio, Andrew Wan:
DNF are teachable in the average case. Mach. Learn. 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 Conference 2007: 83-92 - [i2]Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Krzysztof Onak, Ronitt Rubinfeld, Rocco A. Servedio, Andrew Wan:
Testing for Concise Representations. Electron. Colloquium Comput. Complex. TR07 (2007) - [i1]Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedio, Andrew Wan:
Learning Random Monotone DNF. Electron. Colloquium Comput. Complex. TR07 (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 Bioinform. 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. CCS 2004: 330-343
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: