my advisors are Rocco Servedio and Tal Malkin. i study theoretical computer science. my research interests include computational complexity theory, learning theory, and cryptography.

• Spring 2008: COMSW 6261: Black Box Complexity of Cryptographic Primitives
• Spring 2007: COMSW 4261: Introduction to Cryptography
• Spring 2006: COMSW 4252: Introduction to Computational Learning Theory(CVN)
• Fall 2005: COMSW 4262: Introduction to Cryptography
• Spring 2005: COMSW 6998: Advanced Topics in Computational Learning Theory

• D. Dachman-Soled, H. Lee, T. Malkin, R. Servedio, A. Wan, H. Wee
  Optimal Cryptographic Hardness of Learning Monotone Functions.
  35th International Conference on Automata, Languages and Programming (ICALP), 2008.
  
  
• I. Diakonikolas, H. Lee, K. Matulef, R. Servedio and A. Wan
  Efficiently Testing Sparse GF(2) Polynomials.
  35th International Conference on Automata, Languages and Programming (ICALP), 2008.
  
  
• J. Jackson, H. Lee, R. Servedio and A. Wan
  Learning Random Monotone DNF
  Available as ECCC Tech Report TR07-129.
  
  
• I. Diakonikolas, H. Lee, K. Matulef, K. Onak, R. Rubinfeld, R. Servedio and A. Wan.
  Testing for Concise Representations 48th Annual Symposium on Foundations of Computer Science (FOCS), 2007, pp 549-558.
  
  
• Homin Lee, Rocco Servedio and Andrew Wan.
  DNF are Teachable in the Average Case.
  Machine Learning, 69(2-3):79-96, 2007.
  Preliminary version in Nineteenth Annual Conference on Computational Learning Theory (COLT), 2006, pp. 214--228.
  Mark Fulk Best Student Paper award, COLT 2006.
  
  
• Ariel Elbaz, Homin Lee, Rocco Servedio and Andrew Wan.
  Separating Models of Learning from Correlated and Uncorrelated Data.
  Journal of Machine Learning Research, 8(Feb):277-290, 2007.
  Preliminary version in Eighteenth Annual Conference on Computational Learning Theory (COLT), 2005, pp. 637-651.
  
  
• Rocco Servedio and Andrew Wan.
  Computing Sparse Permanents Faster.
  Information Processing Letters 96(5), 2005, pp. 89-92.