On a Complexity Hierarchy Between L and NL. - Sang Cho; Dung T. Huynh (Inf. Process. Lett., 1988)

The complexity of membership for deterministic growing context-sensitive grammars. - Sang Cho; Dung T. Huynh (Int. J. Comput. Math., 1990)

Finite-Automaton Aperiodicity is PSPACE-Complete. - Sang Cho; Dung T. Huynh (Theor. Comput. Sci., 1991)

The Parallel Complexity of Coarsest Set Partition Problems. - Sang Cho; Dung T. Huynh (Inf. Process. Lett., 1992)

The Parallel Complexity of Finite-State Automata Problems - Sang Cho; Dung T. Huynh (Inf. Comput., 1992)