Dung T. Huynh

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2012, 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

Some Observations about the Randomness of Hard Problems

Dung T. Huynh, 1986, SIAM J. Comput..

Software architecture analysis: a dynamic slicing approach

Lawrence Chung, Tae-Ho Kim, Yeong-Tae Song, 2000 .

On the rearrangeability of switching networks composed of digital symmetrical matrices

Dung T. Huynh, Hai N. Nguyen, 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

The Parallel Complexity of Finite-State Automata Problems

Dung T. Huynh, Sang Cho, D. Huynh, 1992, Inf. Comput..

Establishing symmetric connectivity in directional wireless sensor networks equipped with $$2\pi /3$$2π/3 antennas

Min Kyung An, Tien Tran, Dung T. Huynh, 2017, J. Comb. Optim..

Resource- Bounded Kolmogorov Complexity of Hard Languages

Dung T. Huynh, D. Huynh, 1986, SCT.

Minimum Interference Planar Geometric Topology in Wireless Sensor Networks

Dung T. Huynh, Trac N. Nguyen, 2009, WASA.

Antenna Orientation and Range Assignment Algorithms in Directional WSNs

Min Kyung An, Tien Tran, Dung T. Huynh, 2017, IEEE/ACM Transactions on Networking.

Effective Entropies and Data Compression

Dung T. Huynh, D. Huynh, 1991, Inf. Comput..

Finite-Automaton Aperiodicity is PSPACE-Complete

Dung T. Huynh, Sang Cho, D. Huynh, 1991, Theor. Comput. Sci..

Minimum Total Node Interference in Wireless Sensor Networks

Dung T. Huynh, Trac N. Nguyen, Nhat X. Lam, 2010, ADHOCNETS.

A rearrangement algorithm for switching networks composed of digital symmetrical matrices

Dung T. Huynh, Hai N. Nguyen, 2000, Inf. Sci..

Antenna orientation and range assignment in WSNs with directional antennas

Min Kyung An, Tien Tran, Dung T. Huynh, 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

Forward dynamic slicing software systems

Yeong-Tae Song, Dung T. Huynh, 1999 .

On some equivalence relations for probabilistic processes

Lu Tian, Dung T. Huynh, D. Huynh, 1992, Fundamenta Informaticae.

The Complexity of Minimizing Receiver-Based and SINR Edge Interference

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2011, 2011 Proceedings of 20th International Conference on Computer Communications and Networks (ICCCN).

Scheduling problems in interference-aware wireless sensor networks

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2013, 2013 International Conference on Computing, Networking and Communications (ICNC).

Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks

Dung T. Huynh, Trac N. Nguyen, Jason A. Bolla, 2008, WASA.

Dual power assignment optimization for k-edge connectivity in WSNs

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

Minimum latency data aggregation in the physical interference model

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2012, Comput. Commun..

A Note on Almost-Everywhere-Complex Sets and Separating Deterministic-Time-Complexity Classes

Joel I. Seiferas, Dung T. Huynh, John G. Geske, 1991, Inf. Comput..

Minimum Data Aggregation Schedule in Wireless Sensor Networks

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2011, Int. J. Comput. Their Appl..

The Complexity of Equivalence Problems for Commutative Grammars

Dung T. Huynh, 1985, Inf. Control..

A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees

Alan L. Selman, Dung T. Huynh, John G. Geske, 1987, Symposium on Theoretical Aspects of Computer Science.

Broadcast Scheduling Problem in SINR Model

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2014, Int. J. Found. Comput. Sci..

roadcast Scheduling in Packet Radio Networks

Dung T. Huynh, 1998 .

The complexity of ranking

Dung T. Huynh, 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

Connected D-Hop Dominating Sets in Mobile Ad Hoc Networks

Dung T. Huynh, Trac N. Nguyen, D. Huynh, 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

On Deciding Readiness and Failure Equivalences for Processes

Lu Tian, Dung T. Huynh, D. Huynh, 1995, Inf. Comput..

A Superexponential Lower Bound for Gröbner Bases and Church-Rosser Commutative Thue Systems

Dung T. Huynh, D. Huynh, 1986, Inf. Control..

Minimum latency data aggregation in the physical interference model

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2011, MSWiM '11.

Symmetric connectivity in Wireless Sensor Networks with directional antennas

Min Kyung An, Tien Tran, Dung T. Huynh, 2015, 2015 IEEE International Conference on Communications (ICC).

The complexity of ranking simple languages

Dung T. Huynh, 2005, Mathematical systems theory.

On deciding trace equivalences for processes

Lu Tian, Dung T. Huynh, D. Huynh, 1993, Inf. Sci..

Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2

Lu Tian, Dung T. Huynh, Didier Caucal, 1995, Inf. Comput..

Complexity of Closeness, Sparseness and Segment Equivalence for Context-Free and Regular Languages

Dung T. Huynh, 1992, Informatik.

Complexity of the word problem for commutative semigroups of fixed dimension

Dung T. Huynh, D. Huynh, 1985, Acta Informatica.

The complexity of readiness and failure equivalences for processes

Lu Tian, Dung T. Huynh, D. Huynh, 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

The complexity of membership for deterministic growing context-sensitive grammars

Dung T. Huynh, Sang Cho, 1990, Int. J. Comput. Math..

Adapting broadcasting sets to topology changes in packet radio networks

Dung T. Huynh, Thai H. P. Vuong, D. Huynh, 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

Adapting d-hop dominating sets to topology changes in ad hoc networks

Dung T. Huynh, Thai H. P. Vuong, 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes

Lu Tian, Dung T. Huynh, D. Huynh, 1994, Theor. Comput. Sci..

The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

Dung T. Huynh, D. Huynh, 1985, STOC '85.

Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States

Hsu-Chun Yen, Rodney R. Howell, Louis E. Rosier, 1986, Theor. Comput. Sci..

Efficient Detectors and Constructors for Single Languages

Dung T. Huynh, 1991, Int. J. Found. Comput. Sci..

Lu Tian, Dung T. Huynh, D. Huynh, 1994, Theor. Comput. Sci..

Nonuniform Complexity and the Randomness of Certain Complete Languages

Dung T. Huynh, 1992, Theor. Comput. Sci..

On the complexity of bisimilarity of normed probabilistic context-free processes

Lu Tian, Dung T. Huynh, D. Huynh, 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

Energy-efficient connected d-hop dominating sets in wireless sensor networks

Dung T. Huynh, Trac N. Nguyen, D. Huynh, 2009, 2009 IEEE International Conference on Pervasive Computing and Communications.

Commutative Grammars: The Complexity of Uniform Word Problems

Dung T. Huynh, D. Huynh, 1984, Inf. Control..

Extending Order Preserving Encryption for Multi-User Systems

I-Ling Yen, Dung T. Huynh, Liangliang Xiao, 2012, IACR Cryptol. ePrint Arch..

Dynamic software architecture slicing

Lawrence Chung, Taeho Kim, Yeong-Tae Song, 1999, Proceedings. Twenty-Third Annual International Computer Software and Applications Conference (Cat. No.99CB37032).

On Deciding some Equivalences for Concurrent Processes

Lu Tian, Dung T. Huynh, D. Huynh, 1994, RAIRO Theor. Informatics Appl..

The Effective Entropies of Some Extensions of Context-Free Languages

Dung T. Huynh, 1991, Inf. Process. Lett..

Forward Dynamic Interprocedural Program Slicing

Yeong-Tae Song, Dung T. Huynh, 1998 .

Symmetric connectivity in WSNs equipped with multiple directional antennas

Min Kyung An, Tien Tran, Dung T. Huynh, 2017, 2017 International Conference on Computing, Networking and Communications (ICNC).

Dual power assignment optimization and fault tolerance in WSNs

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2015, J. Comb. Optim..

Bounded-degree minimum-radius spanning trees in wireless sensor networks

Min Kyung An, Dung T. Huynh, Trac N. Nguyen, 2013, Theor. Comput. Sci..