People > Dung T.Huynh

Biography:

Professor Huynh received the M.S. and Ph.D. degrees in Computer Science from the University of Saarlandes (Germany) in 1977 and 1978, respectively, where he remained as a postdoctoral research assistant until 1982. From 1982 to 1983 he was a Visiting Assistant Professor at the University of Chicago. He then spent three years as an Assistant Professor of Computer Science at Iowa State University before joining the Computer Science faculty at the University of Texas at Dallas as an Associate Professor in 1986. Dr. Huynh was promoted to Full Professor in 1991, and became Program Head of the Computer Science Program in May 1997. He has been a member of the Advisory Board of the Journal of Automata, Languages and Combinatorics since 1996.

Research Profile:

Dr. Huynh's research interests are in the areas of Computational complexity theory, automata and formal languages, concurrency theory, communications networks and protocols, parallel computation, and software metrics.

Selected Publications:

1. "On Deciding Readiness and Failure Equivalences for Processes", (with Lu Tian), Information and Computation 117, pp. 193-205, 1995.
2. "Deciding Branching Bisimilarity of Normed Context-Free Processes Is in Sigma(2)", (with D. Caucal and L. Tian), Information and Computation 118, pp. 306-315, 1995.
3. "A note on the Complexity of Deciding Bisimilarity of Normed Unary Processes", (with Lu Tian), Theoretical Computer Science 131, pp. 441-448, 1994.
4. "On Deciding Some Equivalences for Concurrent Processes", (with Lu Tian), RAIRO Theoretical Informatics and Applications 27, pp. 51-71, 1994.
5. "Deciding Bisimilarity of Normed Context-Free Processes is in Sigma(2)", (with Lu Tian), Theoretical Computer Science 123, pp. 183-197, 1994.
6. "On Deciding Readiness and Failure Equivalences for Processes", (with Lu Tian), to appear in Information and Computation.
7. "On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices", (with Hai Nguyen), Proc. 5th Intern. Conf. on Computing and Information, pp. 155-159, Sudbury, Canada, 1993.
8. "On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes", (with Lu Tian), Proc. 5th Intern. Conf. on Computing and Information, pp. 3-7, Sudbury, Canada, 1993.
9. "On Deciding Trace Equivalence for Processes", (with Lu Tian), Information Sciences 72, pp. 105-121, 1993.
10. "The Complexity of Deciding Code and Monoid Properties for Regular Sets", International Journal of Algebra and Computation, Vol. 2, pp. 39-55, 1992.
11. "On Some Equivalence Relations for Probabilistic Processes", (with Lu Tian), Fundamenta Informaticae 17, pp. 211-234, 1992.
12. "Non-Uniform Complexity and the Randomness of Certain Complete Languages", Theoretical Computer Science, Vol. 96, pp. 305-324, 1992.
13. "The Parallel Complexity of Coarsest Set Partition Problems", (with Sang Cho), Information Processing Letters, Vol. 42, pp. 89-94, 1992.
14. "Efficient Detectors and Constructors for Simple Languages", International Journal of Foundations of Computer Sciences, Vol. 2, pp. 183-205, 1992.
15. "The Parallel Complexity of Finite State Automata Problems", (with Sang Cho), Information and Computation, Vol. 97, pp. 1-22, 1992.
16. "The Effective Entropies of Some Extensions of Context-Free Languages", Information Processing Letters, Vol. 37, pp. 165-169, 1991.
17. "A Note on Separating Deterministic-Time-Complexity Classes, and on Almost-Everywhere Complex Sets", (with J. Geske and J. Seifera), Information and Computation, Vol. 92, pp. 97-104, 1991.
18. "Finite Automaton Aperiodicity is PSPACE-Complete", (with Sang Cho), Theoretical Computer Science, Vol. 88, pp. 99-116, 1991.
19. "Effective Entropies and Data Compression", Information and Computation, Vol. 90, pp. 67-85, 1991.