Dung T. Huynh

77 papers A* 4A 2B 9C 4Misc 2Journal 44Unranked 10
YearRankTypeTitle / Venue / Authors
2023 J jnl
Improved algorithms in directional wireless sensor networks.
J. Comb. Optim.
Tan D. Lam, Dung T. Huynh
2023 A* conf
Target Coverage and Connectivity in Directional Wireless Sensor Networks.
INFOCOM
Tan D. Lam, Dung T. Huynh
2022 B conf
Improved Algorithms in Directional Wireless Sensor Networks.
WCNC
Tan D. Lam, Dung T. Huynh
2022 J jnl
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas.
Int. J. Found. Comput. Sci.
Tien Tran, Dung T. Huynh
2020 J jnl
The complexity of symmetric connectivity in directional wireless sensor networks.
J. Comb. Optim.
Tien Tran, Dung T. Huynh
2018 A* conf
Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks.
INFOCOM
Tien Tran, Dung T. Huynh
2017 J jnl
Antenna Orientation and Range Assignment Algorithms in Directional WSNs.
IEEE/ACM Trans. Netw.
Tien Tran, Min Kyung An, Dung T. Huynh
2017 J jnl
Establishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennas.
J. Comb. Optim.
Tien Tran, Min Kyung An, Dung T. Huynh
2017 Misc conf
Symmetric connectivity in WSNs equipped with multiple directional antennas.
ICNC
Tien Tran, Min Kyung An, Dung T. Huynh
2016 A* conf
Antenna orientation and range assignment in WSNs with directional antennas.
INFOCOM
Tien Tran, Min Kyung An, Dung T. Huynh
2015 J jnl
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model.
Theor. Comput. Sci.
Nhat X. Lam, Tien Tran, Min Kyung An, Dung T. Huynh
2015 J jnl
Dual power assignment optimization and fault tolerance in WSNs.
J. Comb. Optim.
Nhat X. Lam, Trac N. Nguyen, Min Kyung An, Dung T. Huynh
2015 — conf
Symmetric connectivity in Wireless Sensor Networks with directional antennas.
ICC
Tien Tran, Min Kyung An, Dung T. Huynh
2014 J jnl
Broadcast Scheduling Problem in SINR Model.
Int. J. Found. Comput. Sci.
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
2013 J jnl
Bounded-degree minimum-radius spanning trees in wireless sensor networks.
Theor. Comput. Sci.
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
2013 Misc conf
Scheduling problems in interference-aware wireless sensor networks.
ICNC
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
2012 B conf
Connectivity in Wireless Sensor Networks in the SINR Model.
MASCOTS
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
2012 J jnl
Extending Order Preserving Encryption for Multi-User Systems.
IACR Cryptol. ePrint Arch.
Liangliang Xiao, I-Ling Yen, Dung T. Huynh
2012 J jnl
Minimum latency data aggregation in the physical interference model.
Comput. Commun.
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
2011 B conf
Dual power assignment optimization for k-edge connectivity in WSNs.
SECON
Nhat X. Lam, Trac N. Nguyen, Min Kyung An, Dung T. Huynh
2011 J jnl
Minimum Data Aggregation Schedule in Wireless Sensor Networks.
Int. J. Comput. Their Appl.
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
2011 A conf
Minimum latency data aggregation in the physical interference model.
MSWiM
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
2011 B conf
The Complexity of Minimizing Receiver-Based and SINR Edge Interference.
ICCCN
Trac N. Nguyen, Min Kyung An, Nhat X. Lam, Dung T. Huynh
2010 C conf
Minimum Data Aggregation Schedule in Wireless Sensor Networks.
CAINE
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
2010 — conf
Minimum Edge Interference in Wireless Sensor Networks.
WASA
Trac N. Nguyen, Nhat X. Lam, Dung T. Huynh, Jason A. Bolla
2010 — conf
Minimum Total Node Interference in Wireless Sensor Networks.
ADHOCNETS
Nhat X. Lam, Trac N. Nguyen, Dung T. Huynh
2009 — conf
Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks.
PerCom Workshops
Trac N. Nguyen, Dung T. Huynh
2009 — conf
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks.
WASA
Trac N. Nguyen, Dung T. Huynh
2008 — conf
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks.
WASA
Trac N. Nguyen, Dung T. Huynh, Jason A. Bolla
2008 — ed.
Wireless Algorithms, Systems, and Applications, Third International Conference, WASA 2008, Dallas, TX, USA, October 26-28, 2008. Proceedings
WASA
Yingshu Li, Dung T. Huynh, Sajal K. Das, Ding-Zhu Du
2007 — conf
Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets.
DIALM-POMC
Trac N. Nguyen, Dung T. Huynh
2006 C conf
Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks.
IPCCC
Jason A. Bolla, Dung T. Huynh
2006 B conf
Connected d-hop dominating sets in mobile ad hoc networks.
WiOpt
Trac N. Nguyen, Dung T. Huynh
2005 B conf
PatZip: Pattern-Preserved Spatial Data Compression.
PAKDD
Yu Qian, Kang Zhang, Dung T. Huynh
2001 J jnl
Dynamic slicing object-oriented programs using dynamic object relationship diagrams.
ACIS Int. J. Comput. Inf. Sci.
Yeong-Tae Song, Dung T. Huynh
2000 J jnl
A rearrangement algorithm for switching networks composed of digital symmetrical matrices.
Inf. Sci.
Dung T. Huynh, Hai N. Nguyen
2000 B conf
Adapting d-hop dominating sets to topology changes in ad hoc networks.
ICCCN
Thai H. P. Vuong, Dung T. Huynh
2000 J jnl
Software architecture analysis: a dynamic slicing approach.
ACIS Int. J. Comput. Inf. Sci.
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
1999 B conf
Adapting broadcasting sets to topology changes in packet radio networks.
ICCCN
Thai H. P. Vuong, Dung T. Huynh
1999 B conf
Dynamic Software Architecture Slicing.
COMPSAC
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
1995 J jnl
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2
Inf. Comput.
Didier Caucal, Dung T. Huynh, Lu Tian
1995 J jnl
On Deciding Readiness and Failure Equivalences for Processes
Inf. Comput.
Dung T. Huynh, Lu Tian
1994 J jnl
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes.
Theor. Comput. Sci.
Dung T. Huynh, Lu Tian
1994 J jnl
Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2.
Theor. Comput. Sci.
Dung T. Huynh, Lu Tian
1994 J jnl
On Deciding some Equivalences for Concurrent Processes.
RAIRO Theor. Informatics Appl.
Dung T. Huynh, Lu Tian
1993 J jnl
On deciding trace equivalences for processes.
Inf. Sci.
Dung T. Huynh, Lu Tian
1993 C conf
On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes.
ICCI
Dung T. Huynh, Lu Tian
1993 C conf
On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices.
ICCI
Dung T. Huynh, Hai N. Nguyen
1992 — ch.
Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages.
Informatik
Dung T. Huynh
1992 J jnl
Nonuniform Complexity and the Randomness of Certain Complete Languages.
Theor. Comput. Sci.
Dung T. Huynh
1992 J jnl
On some equivalence relations for probabilistic processes.
Fundam. Informaticae
Dung T. Huynh, Lu Tian
1992 J jnl
The Complexity of Deciding Code and Monoid Properties for Regular Sets.
Int. J. Algebra Comput.
Dung T. Huynh
1992 J jnl
The Parallel Complexity of Coarsest Set Partition Problems.
Inf. Process. Lett.
Sang Cho, Dung T. Huynh
1992 J jnl
The Parallel Complexity of Finite-State Automata Problems
Inf. Comput.
Sang Cho, Dung T. Huynh
1991 J jnl
A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes
Inf. Comput.
John G. Geske, Dung T. Huynh, Joel I. Seiferas
1991 J jnl
Effective Entropies and Data Compression
Inf. Comput.
Dung T. Huynh
1991 J jnl
Efficient Detectors and Constructors for Single Languages.
Int. J. Found. Comput. Sci.
Dung T. Huynh
1991 J jnl
Finite-Automaton Aperiodicity is PSPACE-Complete.
Theor. Comput. Sci.
Sang Cho, Dung T. Huynh
1991 J jnl
The Effective Entropies of Some Extensions of Context-Free Languages.
Inf. Process. Lett.
Dung T. Huynh
1991 — conf
The complexity of readiness and failure equivalences for processes.
SPDP
Dung T. Huynh, Lu Tian
1990 J jnl
The Complexity of Ranking Simple Languages.
Math. Syst. Theory
Dung T. Huynh
1990 J jnl
The complexity of membership for deterministic growing context-sensitive grammars.
Int. J. Comput. Math.
Sang Cho, Dung T. Huynh
1988 J jnl
On a Complexity Hierarchy Between L and NL.
Inf. Process. Lett.
Sang Cho, Dung T. Huynh
1988 — conf
The complexity of ranking.
SCT
Dung T. Huynh
1987 A conf
A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees.
STACS
John G. Geske, Dung T. Huynh, Alan L. Selman
1987 J jnl
On Solving Hard Problems by Polynomial-Size Circuits.
Inf. Process. Lett.
Dung T. Huynh
1986 J jnl
A Simple Proof for the Sum
J. Inf. Process. Cybern.
Dung T. Huynh
1986 J jnl
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems
Inf. Control.
Dung T. Huynh
1986 — conf
Resource- Bounded Kolmogorov Complexity of Hard Languages.
SCT
Dung T. Huynh
1986 J jnl
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
Theor. Comput. Sci.
Rodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen
1986 J jnl
Some Observations about the Randomness of Hard Problems.
SIAM J. Comput.
Dung T. Huynh
1986 J jnl
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals.
SIAM J. Comput.
Dung T. Huynh
1985 J jnl
Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension.
Acta Informatica
Dung T. Huynh
1985 J jnl
The Complexity of Equivalence Problems for Commutative Grammars
Inf. Control.
Dung T. Huynh
1985 A* conf
The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems
STOC
Dung T. Huynh
1984 J jnl
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete.
Theor. Comput. Sci.
Dung T. Huynh
1983 J jnl
Commutative Grammars: The Complexity of Uniform Word Problems
Inf. Control.
Dung T. Huynh