Dung T. Huynh Resource- Bounded Kolmogorov Complexity of Hard Languages. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:184-195 [Conf]
Dung T. Huynh The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems [Citation Graph (0, 0)][DBLP] STOC, 1985, pp:405-412 [Conf]
Dung T. Huynh Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension. [Citation Graph (0, 0)][DBLP] Acta Inf., 1985, v:22, n:4, pp:421-432 [Journal]
Dung T. Huynh A Simple Proof for the Sump2 Upper Bound of the Inequivalence Problem for Semilinear Sets. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1986, v:22, n:4, pp:147-156 [Journal]
Dung T. Huynh Commutative Grammars: The Complexity of Uniform Word Problems [Citation Graph (0, 0)][DBLP] Information and Control, 1983, v:57, n:1, pp:21-39 [Journal]
Dung T. Huynh The Complexity of Equivalence Problems for Commutative Grammars [Citation Graph (0, 0)][DBLP] Information and Control, 1985, v:66, n:1/2, pp:103-121 [Journal]
Dung T. Huynh A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems [Citation Graph (0, 0)][DBLP] Information and Control, 1986, v:68, n:1-3, pp:196-206 [Journal]
Dung T. Huynh Efficient Detectors and Constructors for Single Languages. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1991, v:2, n:3, pp:183-206 [Journal]
Dung T. Huynh On Solving Hard Problems by Polynomial-Size Circuits. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:3, pp:171-176 [Journal]
Dung T. Huynh The Effective Entropies of Some Extensions of Context-Free Languages. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:37, n:3, pp:165-169 [Journal]
Dung T. Huynh The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:2, pp:581-594 [Journal]
Dung T. Huynh Some Observations about the Randomness of Hard Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:4, pp:1101-1105 [Journal]
Dung T. Huynh Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1984, v:33, n:, pp:305-326 [Journal]
Dung T. Huynh Nonuniform Complexity and the Randomness of Certain Complete Languages. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:96, n:2, pp:305-324 [Journal]
Dung T. Huynh, Lu Tian Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:123, n:2, pp:183-197 [Journal]
Dung T. Huynh, Lu Tian A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:131, n:2, pp:441-448 [Journal]