Dung T. Huynh

Publication Activity (10 Years)

Years Active: 1983-2023
Publications (10 Years): 13

Top Topics

Wireless Sensor Networks

Greedy Heuristics

Data Aggregation

Energy Consumption

Top Venues

J. Comb. Optim.

Int. J. Found. Comput. Sci.

Publications

Tan D. Lam, Dung T. Huynh
Target Coverage and Connectivity in Directional Wireless Sensor Networks. INFOCOM (2023)
Tan D. Lam, Dung T. Huynh
Improved algorithms in directional wireless sensor networks. J. Comb. Optim. 45 (4) (2023)
Tien Tran, Dung T. Huynh
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas. Int. J. Found. Comput. Sci. 33 (2) (2022)
Tan D. Lam, Dung T. Huynh
Improved Algorithms in Directional Wireless Sensor Networks. WCNC (2022)
Tien Tran, Dung T. Huynh
The complexity of symmetric connectivity in directional wireless sensor networks. J. Comb. Optim. 39 (3) (2020)
Tien Tran, Dung T. Huynh
Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks. INFOCOM (2018)
Tien Tran, Min Kyung An, Dung T. Huynh
Establishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennas. J. Comb. Optim. 34 (4) (2017)
Tien Tran, Min Kyung An, Dung T. Huynh
Symmetric connectivity in WSNs equipped with multiple directional antennas. ICNC (2017)
Tien Tran, Min Kyung An, Dung T. Huynh
Antenna Orientation and Range Assignment Algorithms in Directional WSNs. IEEE/ACM Trans. Netw. 25 (6) (2017)
Tien Tran, Min Kyung An, Dung T. Huynh
Antenna orientation and range assignment in WSNs with directional antennas. INFOCOM (2016)
Nhat X. Lam, Tien Tran, Min Kyung An, Dung T. Huynh
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model. Theor. Comput. Sci. 569 (2015)
Tien Tran, Min Kyung An, Dung T. Huynh
Symmetric connectivity in Wireless Sensor Networks with directional antennas. ICC (2015)
Nhat X. Lam, Trac N. Nguyen, Min Kyung An, Dung T. Huynh
Dual power assignment optimization and fault tolerance in WSNs. J. Comb. Optim. 30 (1) (2015)
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
Broadcast Scheduling Problem in SINR Model. Int. J. Found. Comput. Sci. 25 (3) (2014)
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
Bounded-degree minimum-radius spanning trees in wireless sensor networks. Theor. Comput. Sci. 498 (2013)
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
Scheduling problems in interference-aware wireless sensor networks. ICNC (2013)
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
Minimum latency data aggregation in the physical interference model. Comput. Commun. 35 (18) (2012)
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
Connectivity in Wireless Sensor Networks in the SINR Model. MASCOTS (2012)
Liangliang Xiao, I-Ling Yen, Dung T. Huynh
Extending Order Preserving Encryption for Multi-User Systems. IACR Cryptol. ePrint Arch. 2012 (2012)
Trac N. Nguyen, Min Kyung An, Nhat X. Lam, Dung T. Huynh
The Complexity of Minimizing Receiver-Based and SINR Edge Interference. ICCCN (2011)
Nhat X. Lam, Trac N. Nguyen, Min Kyung An, Dung T. Huynh
Dual power assignment optimization for k-edge connectivity in WSNs. SECON (2011)
Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen
Minimum latency data aggregation in the physical interference model. MSWiM (2011)
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
Minimum Data Aggregation Schedule in Wireless Sensor Networks. Int. J. Comput. Their Appl. 18 (4) (2011)
Nhat X. Lam, Trac N. Nguyen, Dung T. Huynh
Minimum Total Node Interference in Wireless Sensor Networks. ADHOCNETS (2010)
Trac N. Nguyen, Nhat X. Lam, Dung T. Huynh, Jason A. Bolla
Minimum Edge Interference in Wireless Sensor Networks. WASA (2010)
Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen
Minimum Data Aggregation Schedule in Wireless Sensor Networks. CAINE (2010)
Trac N. Nguyen, Dung T. Huynh
Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks. PerCom Workshops (2009)
Trac N. Nguyen, Dung T. Huynh
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks. WASA (2009)
Trac N. Nguyen, Dung T. Huynh, Jason A. Bolla
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks. WASA (2008)
Trac N. Nguyen, Dung T. Huynh
Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets. DIALM-POMC (2007)
Jason A. Bolla, Dung T. Huynh
Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks. IPCCC (2006)
Trac N. Nguyen, Dung T. Huynh
Connected d-hop dominating sets in mobile ad hoc networks. WiOpt (2006)
Yu Qian, Kang Zhang, Dung T. Huynh
PatZip: Pattern-Preserved Spatial Data Compression. PAKDD (2005)
Yeong-Tae Song, Dung T. Huynh
Dynamic slicing object-oriented programs using dynamic object relationship diagrams. ACIS Int. J. Comput. Inf. Sci. 2 (1) (2001)
Dung T. Huynh, Hai N. Nguyen
A rearrangement algorithm for switching networks composed of digital symmetrical matrices. Inf. Sci. 125 (1-4) (2000)
Thai H. P. Vuong, Dung T. Huynh
Adapting d-hop dominating sets to topology changes in ad hoc networks. ICCCN (2000)
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
Software architecture analysis: a dynamic slicing approach. ACIS Int. J. Comput. Inf. Sci. 1 (2) (2000)
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh
Dynamic Software Architecture Slicing. COMPSAC (1999)
Thai H. P. Vuong, Dung T. Huynh
Adapting broadcasting sets to topology changes in packet radio networks. ICCCN (1999)
Dung T. Huynh, Lu Tian
On Deciding Readiness and Failure Equivalences for Processes Inf. Comput. 117 (2) (1995)
Didier Caucal, Dung T. Huynh, Lu Tian
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2 Inf. Comput. 118 (2) (1995)
Dung T. Huynh, Lu Tian
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes. Theor. Comput. Sci. 131 (2) (1994)
Dung T. Huynh, Lu Tian
On Deciding some Equivalences for Concurrent Processes. RAIRO Theor. Informatics Appl. 28 (1) (1994)
Dung T. Huynh, Lu Tian
Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2. Theor. Comput. Sci. 123 (2) (1994)
Dung T. Huynh, Lu Tian
On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes. ICCI (1993)
Dung T. Huynh, Hai N. Nguyen
On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices. ICCI (1993)
Dung T. Huynh, Lu Tian
On deciding trace equivalences for processes. Inf. Sci. 72 (1-2) (1993)
Sang Cho, Dung T. Huynh
The Parallel Complexity of Coarsest Set Partition Problems. Inf. Process. Lett. 42 (2) (1992)
Dung T. Huynh
Nonuniform Complexity and the Randomness of Certain Complete Languages. Theor. Comput. Sci. 96 (2) (1992)
Sang Cho, Dung T. Huynh
The Parallel Complexity of Finite-State Automata Problems Inf. Comput. 97 (1) (1992)
Dung T. Huynh, Lu Tian
On some equivalence relations for probabilistic processes. Fundam. Informaticae 17 (3) (1992)
Dung T. Huynh
The Complexity of Deciding Code and Monoid Properties for Regular Sets. Int. J. Algebra Comput. 2 (1) (1992)
Dung T. Huynh, Lu Tian
The complexity of readiness and failure equivalences for processes. SPDP (1991)
Dung T. Huynh
Effective Entropies and Data Compression Inf. Comput. 90 (1) (1991)
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) (1991)
Sang Cho, Dung T. Huynh
Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88 (1) (1991)
Dung T. Huynh
The Effective Entropies of Some Extensions of Context-Free Languages. Inf. Process. Lett. 37 (3) (1991)
Dung T. Huynh
Efficient Detectors and Constructors for Single Languages. Int. J. Found. Comput. Sci. 2 (3) (1991)
Dung T. Huynh
The Complexity of Ranking Simple Languages. Math. Syst. Theory 23 (1) (1990)
Sang Cho, Dung T. Huynh
The complexity of membership for deterministic growing context-sensitive grammars. Int. J. Comput. Math. 37 (3-4) (1990)
Sang Cho, Dung T. Huynh
On a Complexity Hierarchy Between L and NL. Inf. Process. Lett. 29 (4) (1988)
Dung T. Huynh
The complexity of ranking. Computational Complexity Conference (1988)
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)
Dung T. Huynh
On Solving Hard Problems by Polynomial-Size Circuits. Inf. Process. Lett. 24 (3) (1987)
Dung T. Huynh
Resource- Bounded Kolmogorov Complexity of Hard Languages. Computational Complexity Conference (1986)
Dung T. Huynh
Some Observations about the Randomness of Hard Problems. SIAM J. Comput. 15 (4) (1986)
Dung T. Huynh
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. SIAM J. Comput. 15 (2) (1986)
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) (1986)
Dung T. Huynh
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems Inf. Control. 68 (1-3) (1986)
Dung T. Huynh
Upper Bound of the Inequivalence Problem for Semilinear Sets. J. Inf. Process. Cybern. 22 (4) (1986)
Dung T. Huynh
The Complexity of Equivalence Problems for Commutative Grammars Inf. Control. 66 (1/2) (1985)
Dung T. Huynh
Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension. Acta Informatica 22 (4) (1985)
Dung T. Huynh
The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems STOC (1985)
Dung T. Huynh
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete. Theor. Comput. Sci. 33 (1984)
Dung T. Huynh
Commutative Grammars: The Complexity of Uniform Word Problems Inf. Control. 57 (1) (1983)