Sotabase

Career

· Postdoctoral Research Fellow, Columbia University2024–
· Boas Assistant Professor (Postdoc), Northwestern University2022–2025
· International Procurement and Contracting Officer, Defense Acquisition Procurement Administration (Republic of Korea)2012–2014
· Judge Advocate General's Corps, Republic of Korea Army2011–2014
· J.D., New York University School of Law2009–
· A.B., magna cum laude, Harvard University2005–
· Teaching Assistant, Columbia University2004–2009
· Columbia Video Network Course Manager, Columbia University2003–2006
· Software Engineer, CJ ENM
· PhD in Computer Science, Columbia University
· PhD Student, Columbia University
· Software Engineer, Datadog
· Corporate Lawyer, Greenberg Traurig LLP
· Graduate Student, Indiana University Bloomington
· Postdoctoral Researcher, University of Texas at Austin

Publications (26)

What Can We Learn Privately?
2008 49th Annual IEEE Symposium on Foundations of Computer Science · 2008
1,573
cited
Coexpression analysis of human genes across many microarray data sets.
Genome Research · 2004
794
cited
ErmineJ: Tool for functional analysis of gene expression data sets
BMC Bioinformatics · 2005
300
cited
Testing for Concise Representations
IEEE Annual Symposium on Foundations of Computer Science · 2007
129
cited
DDSketch: A Fast and Fully-Mergeable Quantile Sketch with Relative-Error Guarantees
Proceedings of the VLDB Endowment · 2019
84
cited
Cryptographic strength of ssl/tls servers: current and recent practices
ACM/SIGCOMM Internet Measurement Conference · 2007
69
cited
Bioinformatic analysis of autism positional candidate genes using biological databases and computational gene network prediction
Genes, Brain and Behavior · 2003
63
cited
The dual receiver cryptosystem and its applications
Conference on Computer and Communications Security · 2004
44
cited
Mansour's Conjecture is True for Random DNF Formulas
Electron. Colloquium Comput. Complex. · 2010
35
cited
Learning random monotone DNF
Discrete Applied Mathematics · 2008
25
cited
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Annual Conference Computational Learning Theory · 2011
20
cited
Optimal Cryptographic Hardness of Learning Monotone Functions
Theory of Computing · 2008
18
cited
Efficiently Testing Sparse GF(2) Polynomials
Algorithmica · 2008
17
cited
DNF are teachable in the average case
Machine-mediated learning · 2006
12
cited
Decision Trees and Influence: an Inductive Proof of the OSSS Inequality
Theory of Computing · 2010
7
cited
On the learnability of monotone functions
2009
7
cited
The Efficient Dual Receiver Cryptosystem and Its Applications
International Journal of Network Security · 2011
7
cited
Separating Models of Learning from Correlated and Uncorrelated Data
Journal of machine learning research · 2007
4
cited
Learning Talagrand DNF Formulas.
Annual Conference Computational Learning Theory · 2010
2
cited
Global rigidity of actions by higher rank lattices with dominated splitting
2020
1
cited
Sotabase
Homin K. Lee | Researcher Profile | Sotabase | Sotabase