Dung T. Huynh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 75 from 75

2023

Target Coverage and Connectivity in Directional Wireless Sensor NetworksTan D. Lam, Dung T. Huynh. infocom 2023: 1-10 [doi]

Improved algorithms in directional wireless sensor networksTan D. Lam, Dung T. Huynh. jco, 45(4):99, May 2023. [doi]

2022

Improved Algorithms in Directional Wireless Sensor NetworksTan D. Lam, Dung T. Huynh. wcnc 2022: 2352-2357 [doi]

Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional AntennasTien Tran, Dung T. Huynh. ijfcs, 33(2):119-140, 2022. [doi]

2020

The complexity of symmetric connectivity in directional wireless sensor networksTien Tran, Dung T. Huynh. jco, 39(3):662-686, 2020. [doi]

2018

Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor NetworksTien Tran, Dung T. Huynh. infocom 2018: 333-341 [doi]

2017

Symmetric connectivity in WSNs equipped with multiple directional antennasTien Tran, Min Kyung An, Dung T. Huynh. iccnc 2017: 609-614 [doi]

Establishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennasTien Tran, Min Kyung An, Dung T. Huynh. jco, 34(4):1029-1051, 2017. [doi]

Antenna Orientation and Range Assignment Algorithms in Directional WSNsTien Tran, Min Kyung An, Dung T. Huynh. ton, 25(6):3368-3381, 2017. [doi]

2016

Antenna orientation and range assignment in WSNs with directional antennasTien Tran, Min Kyung An, Dung T. Huynh. infocom 2016: 1-9 [doi]

2015

2014

Broadcast Scheduling Problem in SINR ModelNhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen. ijfcs, 25(3):331-342, 2014. [doi]

2013

Bounded-degree minimum-radius spanning trees in wireless sensor networksMin Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen. TCS, 498:46-57, 2013. [doi]

Scheduling problems in interference-aware wireless sensor networksNhat X. Lam, Min Kyung An, Dung T. Huynh, Trac N. Nguyen. iccnc 2013: 783-789 [doi]

2012

2011

2010

Minimum Data Aggregation Schedule in Wireless Sensor NetworksMin Kyung An, Nhat X. Lam, Dung T. Huynh, Trac N. Nguyen. caine 2010: 257-263

Minimum Total Node Interference in Wireless Sensor NetworksNhat X. Lam, Trac N. Nguyen, Dung T. Huynh. adhocnets 2010: 507-523 [doi]

Minimum Edge Interference in Wireless Sensor NetworksTrac N. Nguyen, Nhat X. Lam, Dung T. Huynh, Jason A. Bolla. wasa 2010: 57-67 [doi]

2009

Energy-Efficient Connected D-Hop Dominating Sets in Wireless Sensor NetworksTrac N. Nguyen, Dung T. Huynh. percom 2009: 1-6 [doi]

Minimum Interference Planar Geometric Topology in Wireless Sensor NetworksTrac N. Nguyen, Dung T. Huynh. wasa 2009: 149-158 [doi]

2008

Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor NetworksTrac N. Nguyen, Dung T. Huynh, Jason A. Bolla. wasa 2008: 176-187 [doi]

2007

Extending Wireless Sensor Networks Lifetime using Disjoint Connected Dominating SetsTrac N. Nguyen, Dung T. Huynh. dialm 2007:

2006

Adapting connected d-hop dominating sets to topology changes in wireless ad hoc networksJason A. Bolla, Dung T. Huynh. ipccc 2006: [doi]

Connected d-hop dominating sets in mobile ad hoc networksTrac N. Nguyen, Dung T. Huynh. wiopt 2006: 65-72

2001

Dynamic slicing object-oriented programs using dynamic object relationship diagramsYeong-Tae Song, Dung T. Huynh. acisj, 2(1):35-48, 2001. [doi]

2000

A rearrangement algorithm for switching networks composed of digital symmetrical matricesDung T. Huynh, Hai N. Nguyen. isci, 125(1-4):83-98, 2000.

Software architecture analysis: a dynamic slicing approachTaeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh. acisj, 1(2):91-103, 2000. [doi]

Adapting d-hop dominating sets to topology changes in ad hoc networksThai H. P. Vuong, Dung T. Huynh. icccn 2000: 348-353 [doi]

1999

Dynamic Software Architecture SlicingTaeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T. Huynh. compsac 1999: 61-66 [doi]

Adapting broadcasting sets to topology changes in packet radio networksThai H. P. Vuong, Dung T. Huynh. icccn 1999: 263-268 [doi]

1995

Deciding Branching Bimiliarity of Normed Context-Free Processes Is in /Sigma^ p_2Didier Caucal, Dung T. Huynh, Lu Tian. iandc, 118(2):306-315, May 1995.

On Deciding Readiness and Failure Equivalences for ProcessesDung T. Huynh, Lu Tian. iandc, 117(2):193-205, March 1995.

1994

A Note on the Complexity of Deciding Bisimilarity of Normed Unary ProcessesDung T. Huynh, Lu Tian. TCS, 131(2):441-448, 1994.

Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2Dung T. Huynh, Lu Tian. TCS, 123(2):183-197, 1994.

On Deciding some Equivalences for Concurrent ProcessesDung T. Huynh, Lu Tian. ita, 28(1):51-71, 1994.

1993

On the Rearrangeability of Switching Networks Composed of Digital Symmetrical MatricesDung T. Huynh, Hai N. Nguyen. icci 1993: 155-159

On the Complexity of Bisimilarity of Normed Probabilistic Context-Free ProcessesDung T. Huynh, Lu Tian. icci 1993: 3-7

On deciding trace equivalences for processesDung T. Huynh, Lu Tian. isci, 72(1-2):105-121, 1993. [doi]

1992

The Parallel Complexity of Coarsest Set Partition ProblemsSang Cho, Dung T. Huynh. ipl, 42(2):89-94, 1992.

The Parallel Complexity of Finite-State Automata ProblemsSang Cho, Dung T. Huynh. iandc, 97(1):1-22, March 1992.

Nonuniform Complexity and the Randomness of Certain Complete LanguagesDung T. Huynh. TCS, 96(2):305-324, 1992.

The Complexity of Deciding Code and Monoid Properties for Regular SetsDung T. Huynh. ijac, 2(1):39-56, 1992. [doi]

Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular LanguagesDung T. Huynh. In Johannes Buchmann 0001, Harald Ganzinger, Wolfgang J. Paul, editors, Informatik, Festschrift zum 60. Geburtstag von Günter Hotz. Volume 1 of Teubner-Texte zur Informatik, pages 235-251, Teubner / Springer, 1992. [doi]

On some equivalence relations for probabilistic processesDung T. Huynh, Lu Tian. FUIN, 17(3):211-234, 1992.

1991

Finite-Automaton Aperiodicity is PSPACE-CompleteSang Cho, Dung T. Huynh. TCS, 88(1):99-116, 1991.

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity ClassesJohn G. Geske, Dung T. Huynh, Joel I. Seiferas. iandc, 92(1):97-104, May 1991.

Efficient Detectors and Constructors for Single LanguagesDung T. Huynh. ijfcs, 2(3):183-206, 1991.

The Effective Entropies of Some Extensions of Context-Free LanguagesDung T. Huynh. ipl, 37(3):165-169, 1991.

Effective Entropies and Data CompressionDung T. Huynh. iandc, 90(1):67-85, January 1991.

The complexity of readiness and failure equivalences for processesDung T. Huynh, Lu Tian. spdp 1991: 738-745 [doi]

1990

The complexity of membership for deterministic growing context-sensitive grammarsSang Cho, Dung T. Huynh. ijcm, 37(3-4):185-188, 1990. [doi]

The Complexity of Ranking Simple LanguagesDung T. Huynh. mst, 23(1):1-19, 1990.

1988

On a Complexity Hierarchy Between L and NLSang Cho, Dung T. Huynh. ipl, 29(4):177-182, 1988.

The complexity of rankingDung T. Huynh. coco 1988: 204-212 [doi]

1987

A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity DegreesJohn G. Geske, Dung T. Huynh, Alan L. Selman. STACS 1987: 125-135

On Solving Hard Problems by Polynomial-Size CircuitsDung T. Huynh. ipl, 24(3):171-176, 1987.

1986

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with StatesRodney R. Howell, Louis E. Rosier, Dung T. Huynh, Hsu-Chun Yen. TCS, 46(3):107-140, 1986.

Resource- Bounded Kolmogorov Complexity of Hard LanguagesDung T. Huynh. cocoon 1986: 184-195

A Simple Proof for the Sum:::p:::::2:: Upper Bound of the Inequivalence Problem for Semilinear SetsDung T. Huynh. eik, 22(4):147-156, 1986.

Some Observations about the Randomness of Hard ProblemsDung T. Huynh. SICOMP, 15(4):1101-1105, 1986.

A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue SystemsDung T. Huynh. iandc, 68(1-3):196-206, January/February/March 1986.

The Complexity of the Membership Problem for Two Subclasses of Polynomial IdealsDung T. Huynh. SICOMP, 15(2):581-594, 1986.

1985

The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition SystemsDung T. Huynh. stoc 1985: 405-412

Complexity of the Word Problem for Commutative Semigroups of Fixed DimensionDung T. Huynh. ACTA, 22(4):421-432, 1985.

The Complexity of Equivalence Problems for Commutative GrammarsDung T. Huynh. iandc, 66(1/2):103-121, July/August 1985.

1984

Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-CompleteDung T. Huynh. TCS, 33:305-326, 1984.

1983

Commutative Grammars: The Complexity of Uniform Word ProblemsDung T. Huynh. iandc, 57(1):21-39, April 1983.

Sign in or sign up to see more results.

runs on WebDSL