Homepage of Inbok Lee

Associate Professor 

Department of Software

Korea Aerospace University

Phone: +82 2 300 0412   Fax: +82 2 3159 9257

 Email: inboklee AT kau DOT ac DOT kr

 Office: Room #406, Electronics building

Snail mail: (School+ Univ.), 76 Hanggongdaehakro, Goyang-city, Gyeonggi-do 10540 Republic of Korea


I received my PhD degree from School of Computer Science and Engineering, Seoul National University. My advisor was Kunsoo Park. In 2005, I was a visiting research associate at Department of Computer Science, King's College London. Since September 2006, I joined School of Electronics, Telecommunication, and Computer Engineering, Korea Aerospace University. Also I was the deputy leader of Team Korea at IOI 2014, 2015, and 2016. I had a joint appointment at Jungseok Institute of Technology affiliated with Korean Air and Department of IT-Biz at Korea Aerospace University. 

Research Interests

Design of algorithms, computer networks, intrusion detection, problem solving 


  • Computer Networks (Fall 2006-2011)
  • Computer Architecture (Spring 2008)
  • Discrete Mathematics
  • Algorithms 
  • Introduction to multimedia (Spring 2009)
  • Advanced Algorithms 


  • 10-0609656 Methods for assembling DNA sequences and computer-readable  medium
  • 10-1245109 정보 검색 시스템의 벡터 유사도 산출방법
  • 10-1258174 자동 인코딩 탐지 시스템


  • Development of efficient algorithms for massive data set, 2007, Korea Aerospace University.
  • Development of efficient pattern matching algorithms for massive online data, 2008, Korea Research Foundation KRF-2008-313-D00840.
  • Development of the fast packet processing and regular expression inspection software for the security intelligence in the IoT environment, IITP. 

Former Students

  • Check the link on the left side which points at my research group. 
  • External PhD committee member for Jeong Eun Song (Inha University) and Seungbum Cho (Seoul National University)


Discrete Mathematics for Computer Sciences by Haggard, Schlipf, and Whitesides in Korean



Surprisingly, my Erdos number is 3.

  • B. Bollobas, D. E. Daykin, P. Erdos. Set of independent edges of a hypergraph. Quart. J. Math. Oxford Ser. (2) 27 (1976) no. 105, 25-32
  • D. E. Daykin, J. W. Daykin, W. F. Smyth. String comparison and Lyndon-like factorization using V-order in linear time. CPM 2011: 65-76
  • M. S. Rahman, C. S. Iliopouolos, I. Lee, M. Mohamed, W. F. Smyth. Finding patterns with variable length gaps or don't cares. COCOON 2006: 146-155