Sang Cho

	1992
4		Sang Cho, Dung T. Huynh: The Parallel Complexity of Finite-State Automata Problems Inf. Comput. 97(1): 1-22 (1992)
3		Sang Cho, Dung T. Huynh: The Parallel Complexity of Coarsest Set Partition Problems. Inf. Process. Lett. 42(2): 89-94 (1992)
	1991
2		Sang Cho, Dung T. Huynh: Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1): 99-116 (1991)
	1988
1		Sang Cho, Dung T. Huynh: On a Complexity Hierarchy Between L and NL. Inf. Process. Lett. 29(4): 177-182 (1988)

Coauthor Index

1

Dung T. Huynh

[1] [2] [3] [4]

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page