 | 2012 |
|---|
| 50 |       | Liangliang Xiao,
I-Ling Yen,
Dung T. Huynh:
Extending Order Preserving Encryption for Multi-User Systems.
IACR Cryptology ePrint Archive 2012: 192 (2012) |
| 2011 |
|---|
| 49 | | Trac N. Nguyen,
Min Kyung An,
Nhat X. Lam,
Dung T. Huynh:
The Complexity of Minimizing Receiver-Based and SINR Edge Interference.
ICCCN 2011: 1-7 |
| 48 | | Nhat X. Lam,
Min Kyung An,
Dung T. Huynh,
Trac N. Nguyen:
Minimum latency data aggregation in the physical interference model.
MSWiM 2011: 93-102 |
| 47 | | Nhat X. Lam,
Trac N. Nguyen,
Min Kyung An,
Dung T. Huynh:
Dual power assignment optimization for k-edge connectivity in WSNs.
SECON 2011: 566-573 |
| 46 |  | Min Kyung An,
Nhat X. Lam,
Dung T. Huynh,
Trac N. Nguyen:
Minimum Data Aggregation Schedule in Wireless Sensor Networks.
I. J. Comput. Appl. 18(4): 254-262 (2011) |
| 2010 |
|---|
| 45 | | Nhat X. Lam,
Trac N. Nguyen,
Dung T. Huynh:
Minimum Total Node Interference in Wireless Sensor Networks.
ADHOCNETS 2010: 507-523 |
| 44 | | Min Kyung An,
Nhat X. Lam,
Dung T. Huynh,
Trac N. Nguyen:
Minimum Data Aggregation Schedule in Wireless Sensor Networks.
CAINE 2010: 257-263 |
| 43 | | Trac N. Nguyen,
Nhat X. Lam,
Dung T. Huynh,
Jason A. Bolla:
Minimum Edge Interference in Wireless Sensor Networks.
WASA 2010: 57-67 |
| 2009 |
|---|
| 42 | | Trac N. Nguyen,
Dung T. Huynh:
Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks.
PerCom Workshops 2009: 1-6 |
| 41 | | Trac N. Nguyen,
Dung T. Huynh:
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks.
WASA 2009: 149-158 |
| 2008 |
|---|
| 40 | | Yingshu Li,
Dung T. Huynh,
Sajal K. Das,
Ding-Zhu Du:
Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings
Springer 2008 |
| 39 | | Trac N. Nguyen,
Dung T. Huynh,
Jason A. Bolla:
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks.
WASA 2008: 176-187 |
| 2007 |
|---|
| 38 | | Trac N. Nguyen,
Dung T. Huynh:
Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets.
DIALM-POMC 2007 |
| 2006 |
|---|
| 37 | | Jason A. Bolla,
Dung T. Huynh:
Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks.
IPCCC 2006 |
| 36 | | Trac N. Nguyen,
Dung T. Huynh:
Connected d-hop dominating sets in mobile ad hoc networks.
WiOpt 2006: 65-72 |
| 2000 |
|---|
| 35 | | Dung T. Huynh,
Hai N. Nguyen:
A rearrangement algorithm for switching networks composed of digital symmetrical matrices.
Inf. Sci. 125(1-4): 83-98 (2000) |
| 1999 |
|---|
| 34 | | Taeho Kim,
Yeong-Tae Song,
Lawrence Chung,
Dung T. Huynh:
Dynamic Software Architecture Slicing.
COMPSAC 1999: 61-66 |
| 1995 |
|---|
| 33 | | Dung T. Huynh,
Lu Tian:
On Deciding Readiness and Failure Equivalences for Processes
Inf. Comput. 117(2): 193-205 (1995) |
| 32 | | Didier Caucal,
Dung T. Huynh,
Lu Tian:
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2
Inf. Comput. 118(2): 306-315 (1995) |
| 1994 |
|---|
| 31 | | Dung T. Huynh,
Lu Tian:
On Deciding some Equivalences for Concurrent Processes.
ITA 28(1): 51-71 (1994) |
| 30 | | Dung T. Huynh,
Lu Tian:
Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2.
Theor. Comput. Sci. 123(2): 183-197 (1994) |
| 29 | | Dung T. Huynh,
Lu Tian:
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes.
Theor. Comput. Sci. 131(2): 441-448 (1994) |
| 1993 |
|---|
| 28 | | Dung T. Huynh,
Hai N. Nguyen:
On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices.
ICCI 1993: 155-159 |
| 27 | | Dung T. Huynh,
Lu Tian:
On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes.
ICCI 1993: 3-7 |
| 26 | | Dung T. Huynh,
Lu Tian:
On deciding trace equivalences for processes.
Inf. Sci. 72(1-2): 105-121 (1993) |
| 1992 |
|---|
| 25 | | Dung T. Huynh,
Lu Tian:
On some equivalence relations for probabilistic processes.
Fundam. Inform. 17(3): 211-234 (1992) |
| 24 | | Sang Cho,
Dung T. Huynh:
The Parallel Complexity of Finite-State Automata Problems
Inf. Comput. 97(1): 1-22 (1992) |
| 23 | | Sang Cho,
Dung T. Huynh:
The Parallel Complexity of Coarsest Set Partition Problems.
Inf. Process. Lett. 42(2): 89-94 (1992) |
| 22 | | Dung T. Huynh:
Nonuniform Complexity and the Randomness of Certain Complete Languages.
Theor. Comput. Sci. 96(2): 305-324 (1992) |
| 1991 |
|---|
| 21 | | Dung T. Huynh,
Lu Tian:
The complexity of readiness and failure equivalences for processes.
SPDP 1991: 738-745 |
| 20 | | Dung T. Huynh:
Effective Entropies and Data Compression
Inf. Comput. 90(1): 67-85 (1991) |
| 19 | | John G. Geske,
Dung T. Huynh,
Joel I. Seiferas:
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
Inf. Comput. 92(1): 97-104 (1991) |
| 18 | | Dung T. Huynh:
The Effective Entropies of Some Extensions of Context-Free Languages.
Inf. Process. Lett. 37(3): 165-169 (1991) |
| 17 | | Dung T. Huynh:
Efficient Detectors and Constructors for Single Languages.
Int. J. Found. Comput. Sci. 2(3): 183-206 (1991) |
| 16 | | Sang Cho,
Dung T. Huynh:
Finite-Automaton Aperiodicity is PSPACE-Complete.
Theor. Comput. Sci. 88(1): 99-116 (1991) |
| 1990 |
|---|
| 15 | | Dung T. Huynh:
The Complexity of Ranking Simple Languages.
Mathematical Systems Theory 23(1): 1-19 (1990) |
| 1988 |
|---|
| 14 | | Sang Cho,
Dung T. Huynh:
On a Complexity Hierarchy Between L and NL.
Inf. Process. Lett. 29(4): 177-182 (1988) |
| 1987 |
|---|
| 13 | | John G. Geske,
Dung T. Huynh,
Alan L. Selman:
A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees.
STACS 1987: 125-135 |
| 12 | | Dung T. Huynh:
On Solving Hard Problems by Polynomial-Size Circuits.
Inf. Process. Lett. 24(3): 171-176 (1987) |
| 1986 |
|---|
| 11 | | Dung T. Huynh:
Resource- Bounded Kolmogorov Complexity of Hard Languages.
Structure in Complexity Theory Conference 1986: 184-195 |
| 10 | | Dung T. Huynh:
A Simple Proof for the Sump2 Upper Bound of the Inequivalence Problem for Semilinear Sets.
Elektronische Informationsverarbeitung und Kybernetik 22(4): 147-156 (1986) |
| 9 | | Dung T. Huynh:
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems
Information and Control 68(1-3): 196-206 (1986) |
| 8 | | Dung T. Huynh:
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals.
SIAM J. Comput. 15(2): 581-594 (1986) |
| 7 | | Dung T. Huynh:
Some Observations about the Randomness of Hard Problems.
SIAM J. Comput. 15(4): 1101-1105 (1986) |
| 6 | | 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.
Theor. Comput. Sci. 46(3): 107-140 (1986) |
| 1985 |
|---|
| 5 | | Dung T. Huynh:
The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems
STOC 1985: 405-412 |
| 4 | | Dung T. Huynh:
Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension.
Acta Inf. 22(4): 421-432 (1985) |
| 3 | | Dung T. Huynh:
The Complexity of Equivalence Problems for Commutative Grammars
Information and Control 66(1/2): 103-121 (1985) |
| 1984 |
|---|
| 2 | | Dung T. Huynh:
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete.
Theor. Comput. Sci. 33: 305-326 (1984) |
| 1983 |
|---|
| 1 | | Dung T. Huynh:
Commutative Grammars: The Complexity of Uniform Word Problems
Information and Control 57(1): 21-39 (1983) |
Data released under the ODC-BY 1.0 license — See also our legal information page