default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDung T. Huynh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j43]Tan D. Lam
, Dung T. Huynh:
Improved algorithms in directional wireless sensor networks. J. Comb. Optim. 45(4): 99 (2023)- [c31]Tan D. Lam, Dung T. Huynh:
Target Coverage and Connectivity in Directional Wireless Sensor Networks. INFOCOM 2023: 1-10 - 2022
- [j42]Tien Tran, Dung T. Huynh:
Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas. Int. J. Found. Comput. Sci. 33(2): 119-140 (2022) - [c30]Tan D. Lam, Dung T. Huynh:
Improved Algorithms in Directional Wireless Sensor Networks. WCNC 2022: 2352-2357 - 2020
- [j41]Tien Tran, Dung T. Huynh:
The complexity of symmetric connectivity in directional wireless sensor networks. J. Comb. Optim. 39(3): 662-686 (2020)
2010 – 2019
- 2018
- [c29]Tien Tran, Dung T. Huynh:
Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks. INFOCOM 2018: 333-341 - 2017
- [j40]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): 1029-1051 (2017) - [j39]Tien Tran, Min Kyung An, Dung T. Huynh:
Antenna Orientation and Range Assignment Algorithms in Directional WSNs. IEEE/ACM Trans. Netw. 25(6): 3368-3381 (2017) - [c28]Tien Tran, Min Kyung An, Dung T. Huynh:
Symmetric connectivity in WSNs equipped with multiple directional antennas. ICNC 2017: 609-614 - 2016
- [c27]Tien Tran, Min Kyung An, Dung T. Huynh:
Antenna orientation and range assignment in WSNs with directional antennas. INFOCOM 2016: 1-9 - 2015
- [j38]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): 120-138 (2015) - [j37]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: 70-73 (2015) - [c26]Tien Tran, Min Kyung An, Dung T. Huynh:
Symmetric connectivity in Wireless Sensor Networks with directional antennas. ICC 2015: 6400-6405 - 2014
- [j36]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): 331-342 (2014) - 2013
- [j35]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: 46-57 (2013) - [c25]Nhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen:
Scheduling problems in interference-aware wireless sensor networks. ICNC 2013: 783-789 - 2012
- [j34]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): 2175-2186 (2012) - [c24]Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen:
Connectivity in Wireless Sensor Networks in the SINR Model. MASCOTS 2012: 145-152 - [i1]Liangliang Xiao, I-Ling Yen, Dung T. Huynh:
Extending Order Preserving Encryption for Multi-User Systems. IACR Cryptol. ePrint Arch. 2012: 192 (2012) - 2011
- [j33]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): 254-262 (2011) - [c23]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 - [c22]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 - [c21]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 - 2010
- [c20]Nhat X. Lam, Trac N. Nguyen, Dung T. Huynh:
Minimum Total Node Interference in Wireless Sensor Networks. ADHOCNETS 2010: 507-523 - [c19]Min Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen:
Minimum Data Aggregation Schedule in Wireless Sensor Networks. CAINE 2010: 257-263 - [c18]Trac N. Nguyen, Nhat X. Lam, Dung T. Huynh, Jason A. Bolla:
Minimum Edge Interference in Wireless Sensor Networks. WASA 2010: 57-67
2000 – 2009
- 2009
- [c17]Trac N. Nguyen, Dung T. Huynh:
Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor Networks. PerCom Workshops 2009: 1-6 - [c16]Trac N. Nguyen, Dung T. Huynh:
Minimum Interference Planar Geometric Topology in Wireless Sensor Networks. WASA 2009: 149-158 - 2008
- [c15]Trac N. Nguyen, Dung T. Huynh, Jason A. Bolla:
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks. WASA 2008: 176-187 - [e1]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. Lecture Notes in Computer Science 5258, Springer 2008, ISBN 978-3-540-88581-8 [contents] - 2007
- [c14]Trac N. Nguyen, Dung T. Huynh:
Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating Sets. DIALM-POMC 2007 - 2006
- [c13]Jason A. Bolla, Dung T. Huynh:
Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networks. IPCCC 2006 - [c12]Trac N. Nguyen, Dung T. Huynh:
Connected d-hop dominating sets in mobile ad hoc networks. WiOpt 2006: 65-72 - 2005
- [c11]Yu Qian, Kang Zhang, Dung T. Huynh:
PatZip: Pattern-Preserved Spatial Data Compression. PAKDD 2005: 726-736 - 2001
- [j32]Yeong-Tae Song, Dung T. Huynh:
Dynamic slicing object-oriented programs using dynamic object relationship diagrams. ACIS Int. J. Comput. Inf. Sci. 2(1): 35-48 (2001) - 2000
- [j31]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): 91-103 (2000) - [j30]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) - [c10]Thai H. P. Vuong, Dung T. Huynh:
Adapting d-hop dominating sets to topology changes in ad hoc networks. ICCCN 2000: 348-353
1990 – 1999
- 1999
- [c9]Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh:
Dynamic Software Architecture Slicing. COMPSAC 1999: 61-66 - [c8]Thai H. P. Vuong, Dung T. Huynh:
Adapting broadcasting sets to topology changes in packet radio networks. ICCCN 1999: 263-268 - 1995
- [j29]Dung T. Huynh, Lu Tian:
On Deciding Readiness and Failure Equivalences for Processes. Inf. Comput. 117(2): 193-205 (1995) - [j28]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
- [j27]Dung T. Huynh, Lu Tian:
On Deciding some Equivalences for Concurrent Processes. RAIRO Theor. Informatics Appl. 28(1): 51-71 (1994) - [j26]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) - [j25]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
- [j24]Dung T. Huynh, Lu Tian:
On deciding trace equivalences for processes. Inf. Sci. 72(1-2): 105-121 (1993) - [c7]Dung T. Huynh, Lu Tian:
On the Complexity of Bisimilarity of Normed Probabilistic Context-Free Processes. ICCI 1993: 3-7 - [c6]Dung T. Huynh, Hai N. Nguyen:
On the Rearrangeability of Switching Networks Composed of Digital Symmetrical Matrices. ICCI 1993: 155-159 - 1992
- [j23]Dung T. Huynh, Lu Tian:
On some equivalence relations for probabilistic processes. Fundam. Informaticae 17(3): 211-234 (1992) - [j22]Sang Cho, Dung T. Huynh:
The Parallel Complexity of Finite-State Automata Problems. Inf. Comput. 97(1): 1-22 (1992) - [j21]Dung T. Huynh:
The Complexity of Deciding Code and Monoid Properties for Regular Sets. Int. J. Algebra Comput. 2(1): 39-56 (1992) - [j20]Sang Cho, Dung T. Huynh:
The Parallel Complexity of Coarsest Set Partition Problems. Inf. Process. Lett. 42(2): 89-94 (1992) - [j19]Dung T. Huynh:
Nonuniform Complexity and the Randomness of Certain Complete Languages. Theor. Comput. Sci. 96(2): 305-324 (1992) - [p1]Dung T. Huynh:
Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages. Informatik 1992: 235-251 - 1991
- [j18]Dung T. Huynh:
Effective Entropies and Data Compression. Inf. Comput. 90(1): 67-85 (1991) - [j17]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) - [j16]Dung T. Huynh:
Efficient Detectors and Constructors for Single Languages. Int. J. Found. Comput. Sci. 2(3): 183-206 (1991) - [j15]Dung T. Huynh:
The Effective Entropies of Some Extensions of Context-Free Languages. Inf. Process. Lett. 37(3): 165-169 (1991) - [j14]Sang Cho, Dung T. Huynh:
Finite-Automaton Aperiodicity is PSPACE-Complete. Theor. Comput. Sci. 88(1): 99-116 (1991) - [c5]Dung T. Huynh, Lu Tian:
The complexity of readiness and failure equivalences for processes. SPDP 1991: 738-745 - 1990
- [j13]Sang Cho, Dung T. Huynh:
The complexity of membership for deterministic growing context-sensitive grammars. Int. J. Comput. Math. 37(3-4): 185-188 (1990) - [j12]Dung T. Huynh:
The Complexity of Ranking Simple Languages. Math. Syst. Theory 23(1): 1-19 (1990)
1980 – 1989
- 1988
- [j11]Sang Cho, Dung T. Huynh:
On a Complexity Hierarchy Between L and NL. Inf. Process. Lett. 29(4): 177-182 (1988) - [c4]Dung T. Huynh:
The complexity of ranking. SCT 1988: 204-212 - 1987
- [j10]Dung T. Huynh:
On Solving Hard Problems by Polynomial-Size Circuits. Inf. Process. Lett. 24(3): 171-176 (1987) - [c3]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 - 1986
- [j9]Dung T. Huynh:
A Simple Proof for the Sump2 Upper Bound of the Inequivalence Problem for Semilinear Sets. J. Inf. Process. Cybern. 22(4): 147-156 (1986) - [j8]Dung T. Huynh:
A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems. Inf. Control. 68(1-3): 196-206 (1986) - [j7]Dung T. Huynh:
The Complexity of the Membership Problem for Two Subclasses of Polynomial Ideals. SIAM J. Comput. 15(2): 581-594 (1986) - [j6]Dung T. Huynh:
Some Observations about the Randomness of Hard Problems. SIAM J. Comput. 15(4): 1101-1105 (1986) - [j5]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) - [c2]Dung T. Huynh:
Resource- Bounded Kolmogorov Complexity of Hard Languages. SCT 1986: 184-195 - 1985
- [j4]Dung T. Huynh:
Complexity of the Word Problem for Commutative Semigroups of Fixed Dimension. Acta Informatica 22(4): 421-432 (1985) - [j3]Dung T. Huynh:
The Complexity of Equivalence Problems for Commutative Grammars. Inf. Control. 66(1/2): 103-121 (1985) - [c1]Dung T. Huynh:
The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems. STOC 1985: 405-412 - 1984
- [j2]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
- [j1]Dung T. Huynh:
Commutative Grammars: The Complexity of Uniform Word Problems. Inf. Control. 57(1): 21-39 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
