A Smart Movie Recommendation System. - Sang-Ki Ko; Sang-Min Choi; Hae-Sung Eom; Jeong-Won Cha; Hyunchul Cho; Laehyun Kim; Yo-Sub Han (HCI (11), 2011)

Analyzing category correlations for recommendation system. - Bernhard Scholz; Sang-Min Choi; Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (ICUIMC, 2011)

A recommendation system based on a subset of raters. - Bernhard Scholz; Sang-Min Choi; Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (ICUIMC, 2012)

State Complexity of Subtree-Free Regular Tree Languages. - Hae-Sung Eom; Yo-Sub Han; Sang-Ki Ko (DCFS, 2013)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (DCFS, 2013)

State complexity of combined operations for suffix-free regular languages. - Hae-Sung Eom; Yo-Sub Han (Theor. Comput. Sci., 2013)

State Complexity of Combined Operations for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa; Sheng Yu 001 (Discrete Mathematics and Computer Science, 2014)

State Complexity of Boundary of Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han (Int. J. Found. Comput. Sci., 2015)

State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Kai Salomaa (Int. J. Found. Comput. Sci., 2015)

Combined operations on prefix-free and suffix-free languages. - Hae-Sung Eom; Matús Palmovský (NCMA, 2016)

State Complexity of Basic Operations on Non-Returning Regular Languages. - Hae-Sung Eom; Yo-Sub Han; Galina Jirásková (Fundam. Informaticae, 2016)

Operational State Complexity of Subtree-Free Regular Tree Languages. - Sang-Ki Ko; Hae-Sung Eom; Yo-Sub Han (Int. J. Found. Comput. Sci., 2016)