The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dung T. Huynh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
    Dynamic Software Architecture Slicing. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 1999, pp:61-66 [Conf]
  3. Dung T. Huynh, Hai N. Nguyen
    On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:155-159 [Conf]
  4. Dung T. Huynh, Lu Tian
    On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:3-7 [Conf]
  5. John G. Geske, Dung T. Huynh, Alan L. Selman
    A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:125-135 [Conf]
  6. 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]
  7. Trac N. Nguyen, Dung T. Huynh
    Connected d-hop dominating sets in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    WiOpt, 2006, pp:65-72 [Conf]
  8. 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]
  9. 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]
  10. Dung T. Huynh, Lu Tian
    On some equivalence relations for probabilistic processes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1992, v:17, n:3, pp:211-234 [Journal]
  11. Didier Caucal, Dung T. Huynh, Lu Tian
    Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2 [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:306-315 [Journal]
  12. Sang Cho, Dung T. Huynh
    The Parallel Complexity of Finite-State Automata Problems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:97, n:1, pp:1-22 [Journal]
  13. John G. Geske, Dung T. Huynh, Joel I. Seiferas
    A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:1, pp:97-104 [Journal]
  14. 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]
  15. 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]
  16. 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]
  17. Dung T. Huynh
    Effective Entropies and Data Compression [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:90, n:1, pp:67-85 [Journal]
  18. Dung T. Huynh, Lu Tian
    On Deciding Readiness and Failure Equivalences for Processes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:193-205 [Journal]
  19. 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]
  20. Sang Cho, Dung T. Huynh
    On a Complexity Hierarchy Between L and NL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:4, pp:177-182 [Journal]
  21. Sang Cho, Dung T. Huynh
    The Parallel Complexity of Coarsest Set Partition Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:2, pp:89-94 [Journal]
  22. 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]
  23. 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]
  24. Dung T. Huynh, Hai N. Nguyen
    A rearrangement algorithm for switching networks composed of digital symmetrical matrices. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2000, v:125, n:1-4, pp:83-98 [Journal]
  25. Dung T. Huynh, Lu Tian
    On deciding trace equivalences for processes. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1993, v:72, n:1-2, pp:105-121 [Journal]
  26. Dung T. Huynh, Lu Tian
    On Deciding some Equivalences for Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:1, pp:51-71 [Journal]
  27. Dung T. Huynh
    The Complexity of Ranking Simple Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:1, pp:1-19 [Journal]
  28. 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]
  29. 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]
  30. Sang Cho, Dung T. Huynh
    Finite-Automaton Aperiodicity is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:99-116 [Journal]
  31. Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen
    Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:46, n:3, pp:107-140 [Journal]
  32. 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]
  33. 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]
  34. 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]
  35. 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]

  36. Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets. [Citation Graph (, )][DBLP]


  37. Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  38. The complexity of readiness and failure equivalences for processes. [Citation Graph (, )][DBLP]


  39. Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  40. Minimum Interference Planar Geometric Topology in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  41. Minimum Edge Interference in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  42. Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002